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.r550-tall-171734899000303.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 FireWire-PT-17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 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 FireWire-PT-17-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717369382179

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-06-02 23:03:03] [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-06-02 23:03:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:03:03] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 23:03:03] [INFO ] Transformed 428 places.
[2024-06-02 23:03:03] [INFO ] Transformed 656 transitions.
[2024-06-02 23:03:03] [INFO ] Found NUPN structural information;
[2024-06-02 23:03:03] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-06-02 23:03:04] [INFO ] Flatten gal took : 172 ms
[2024-06-02 23:03:04] [INFO ] Flatten gal took : 102 ms
RANDOM walk for 40000 steps (17 resets) in 2143 ms. (18 steps per ms) remains 15/16 properties
FORMULA FireWire-PT-17-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4001 steps (8 resets) in 119 ms. (33 steps per ms) remains 15/15 properties
[2024-06-02 23:03:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9770552214724944560.gal : 80 ms
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
[2024-06-02 23:03:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12818377335043003138.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9770552214724944560.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12818377335043003138.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 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 ...329
BEST_FIRST walk for 4002 steps (8 resets) in 231 ms. (17 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 15/15 properties
Loading property file /tmp/ReachabilityCardinality12818377335043003138.prop.
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 14/15 properties
FORMULA FireWire-PT-17-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 14/14 properties
// Phase 1: matrix 656 rows 428 cols
[2024-06-02 23:03:04] [INFO ] Computed 9 invariants in 15 ms
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :13 after 19
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :19 after 80
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :80 after 97
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :97 after 141
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :141 after 313
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :313 after 601
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 296/428 variables, 9/141 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 296/437 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 656/1084 variables, 428/865 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :601 after 178142
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/1084 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 865 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1381 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem FireWire-PT-17-ReachabilityFireability-2024-13 is UNSAT
FORMULA FireWire-PT-17-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 296/428 variables, 9/141 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 296/437 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-06-02 23:03:06] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 15 ms to minimize.
[2024-06-02 23:03:06] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:03:06] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/440 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Invariant property FireWire-PT-17-ReachabilityFireability-2024-07 does not hold.
Reachability property FireWire-PT-17-ReachabilityFireability-2024-04 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :178142 after 195054
At refinement iteration 6 (OVERLAPS) 656/1084 variables, 428/868 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Reachability property FireWire-PT-17-ReachabilityFireability-2024-11 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property FireWire-PT-17-ReachabilityFireability-2024-03 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :195054 after 204310
At refinement iteration 7 (INCLUDED_ONLY) 0/1084 variables, 12/880 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Reachability property FireWire-PT-17-ReachabilityFireability-2024-12 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :204310 after 228181
Reachability property FireWire-PT-17-ReachabilityFireability-2024-15 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property FireWire-PT-17-ReachabilityFireability-2024-14 does not hold.
FORMULA FireWire-PT-17-ReachabilityFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 8 (INCLUDED_ONLY) 0/1084 variables, 0/880 constraints. Problems are: Problem set: 7 solved, 7 unsolved
[2024-06-02 23:03:08] [INFO ] Deduced a trap composed of 110 places in 159 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/1084 variables, 1/881 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1084 variables, 0/881 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/1084 variables, 0/881 constraints. Problems are: Problem set: 7 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 881 constraints, problems are : Problem set: 7 solved, 7 unsolved in 4361 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 12/14 constraints, Known Traps: 4/4 constraints]
After SMT, in 5938ms problems are : Problem set: 7 solved, 7 unsolved
Invariant property FireWire-PT-17-ReachabilityFireability-2024-06 does not hold.
FORMULA FireWire-PT-17-ReachabilityFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property FireWire-PT-17-ReachabilityFireability-2024-05 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property FireWire-PT-17-ReachabilityFireability-2024-02 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :228181 after 260557
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :260557 after 840437
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :840437 after 871618
Parikh walk visited 0 properties in 32776 ms.
Support contains 46 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 656/656 transitions.
Graph (trivial) has 270 edges and 428 vertex of which 11 / 428 are part of one of the 2 SCC in 7 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1092 edges and 419 vertex of which 413 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 413 transition count 555
Reduce places removed 88 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 97 rules applied. Total rules applied 189 place count 325 transition count 546
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 198 place count 316 transition count 546
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 198 place count 316 transition count 532
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 226 place count 302 transition count 532
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 275 place count 253 transition count 483
Iterating global reduction 3 with 49 rules applied. Total rules applied 324 place count 253 transition count 483
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 324 place count 253 transition count 475
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 340 place count 245 transition count 475
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 347 place count 238 transition count 462
Iterating global reduction 3 with 7 rules applied. Total rules applied 354 place count 238 transition count 462
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 4 rules applied. Total rules applied 358 place count 238 transition count 458
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 360 place count 236 transition count 458
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 422 place count 205 transition count 427
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -124
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 464 place count 184 transition count 551
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 468 place count 184 transition count 547
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 487 place count 184 transition count 528
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 506 place count 165 transition count 528
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 509 place count 165 transition count 525
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 513 place count 165 transition count 525
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 514 place count 165 transition count 525
Applied a total of 514 rules in 188 ms. Remains 165 /428 variables (removed 263) and now considering 525/656 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 165/428 places, 525/656 transitions.
RANDOM walk for 40000 steps (14 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (15 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (24 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (14 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (13 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 505448 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :1 out of 4
Probabilistic random walk after 505448 steps, saw 115246 distinct states, run finished after 3020 ms. (steps per millisecond=167 ) properties seen :1
FORMULA FireWire-PT-17-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 23:03:46] [INFO ] Flow matrix only has 518 transitions (discarded 7 similar events)
// Phase 1: matrix 518 rows 165 cols
[2024-06-02 23:03:46] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:03:46] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 128/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 516/672 variables, 156/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 26/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/682 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/682 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/683 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/683 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/683 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 683/683 variables, and 198 constraints, problems are : Problem set: 0 solved, 3 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 165/165 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 128/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 23:03:47] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:03:47] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 516/672 variables, 156/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 26/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 10/682 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/682 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/683 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/683 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/683 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 683/683 variables, and 203 constraints, problems are : Problem set: 0 solved, 3 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 165/165 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1120ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1113 ms.
Support contains 28 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 525/525 transitions.
Graph (trivial) has 33 edges and 165 vertex of which 2 / 165 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 522
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 163 transition count 522
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 163 transition count 521
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 162 transition count 521
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 161 transition count 479
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 161 transition count 479
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 161 transition count 478
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 20 place count 155 transition count 472
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 152 transition count 485
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 29 place count 152 transition count 482
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 36 place count 152 transition count 475
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 88 place count 145 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 113 place count 145 transition count 405
Applied a total of 113 rules in 82 ms. Remains 145 /165 variables (removed 20) and now considering 405/525 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 145/165 places, 405/525 transitions.
RANDOM walk for 40000 steps (1334 resets) in 555 ms. (71 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (332 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (128 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (310 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1161446 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :2 out of 3
Probabilistic random walk after 1161446 steps, saw 318124 distinct states, run finished after 3001 ms. (steps per millisecond=387 ) properties seen :2
FORMULA FireWire-PT-17-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-17-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 23:03:52] [INFO ] Flow matrix only has 398 transitions (discarded 7 similar events)
// Phase 1: matrix 398 rows 145 cols
[2024-06-02 23:03:52] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:03:52] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/138 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 398/536 variables, 138/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 57/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/543 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/138 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 398/536 variables, 138/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 57/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/543 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/543 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 702ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 26 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 405/405 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 145 transition count 404
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 144 transition count 404
Applied a total of 2 rules in 9 ms. Remains 144 /145 variables (removed 1) and now considering 404/405 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 144/145 places, 404/405 transitions.
RANDOM walk for 40000 steps (1356 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (338 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1219257 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :0 out of 1
Probabilistic random walk after 1219257 steps, saw 339666 distinct states, run finished after 3001 ms. (steps per millisecond=406 ) properties seen :0
[2024-06-02 23:03:56] [INFO ] Flow matrix only has 397 transitions (discarded 7 similar events)
// Phase 1: matrix 397 rows 144 cols
[2024-06-02 23:03:56] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:03:56] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/137 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 397/534 variables, 137/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 57/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/541 variables, 7/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/541 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/137 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 397/534 variables, 137/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 57/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/541 variables, 7/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/541 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 26 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 404/404 transitions.
Applied a total of 0 rules in 7 ms. Remains 144 /144 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 144/144 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 404/404 transitions.
Applied a total of 0 rules in 7 ms. Remains 144 /144 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-06-02 23:03:56] [INFO ] Flow matrix only has 397 transitions (discarded 7 similar events)
[2024-06-02 23:03:56] [INFO ] Invariant cache hit.
[2024-06-02 23:03:57] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 23:03:57] [INFO ] Flow matrix only has 397 transitions (discarded 7 similar events)
[2024-06-02 23:03:57] [INFO ] Invariant cache hit.
[2024-06-02 23:03:57] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 23:03:57] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-06-02 23:03:57] [INFO ] Redundant transitions in 23 ms returned []
Running 402 sub problems to find dead transitions.
[2024-06-02 23:03:57] [INFO ] Flow matrix only has 397 transitions (discarded 7 similar events)
[2024-06-02 23:03:57] [INFO ] Invariant cache hit.
[2024-06-02 23:03:57] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-06-02 23:03:59] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:03:59] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:03:59] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:04:00] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:04:00] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:04:00] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:04:01] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:04:01] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 4 (OVERLAPS) 397/541 variables, 144/159 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 57/216 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-06-02 23:04:05] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 8 (OVERLAPS) 0/541 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 402 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 217 constraints, problems are : Problem set: 0 solved, 402 unsolved in 16971 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 402 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-06-02 23:04:16] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 5 (OVERLAPS) 397/541 variables, 144/161 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 57/218 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 402/620 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-06-02 23:04:33] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/541 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 621 constraints, problems are : Problem set: 0 solved, 402 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 11/11 constraints]
After SMT, in 47358ms problems are : Problem set: 0 solved, 402 unsolved
Search for dead transitions found 0 dead transitions in 47366ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47738 ms. Remains : 144/144 places, 404/404 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 57 edges and 144 vertex of which 9 / 144 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 607 edges and 137 vertex of which 135 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 133 transition count 350
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 133 transition count 350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 133 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 1 with 17 rules applied. Total rules applied 27 place count 133 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 132 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 132 transition count 328
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 132 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 131 transition count 327
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 40 place count 131 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 131 transition count 326
Applied a total of 41 rules in 39 ms. Remains 131 /144 variables (removed 13) and now considering 326/404 (removed 78) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 326 rows 131 cols
[2024-06-02 23:04:44] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:04:44] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:04:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:04:44] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:04:44] [INFO ] After 33ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 23:04:44] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:45] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:45] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:04:45] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:04:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5488250276099512995.gal : 3 ms
[2024-06-02 23:04:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10243027182313088515.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/ReachabilityCardinality5488250276099512995.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10243027182313088515.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10243027182313088515.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 80
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :80 after 168
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :168 after 460
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :460 after 1188
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1188 after 2136
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2136 after 3358
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3358 after 22377
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :22377 after 89685
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :89685 after 2.24533e+06
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,2.03077e+08,10.6029,116196,2,7729,19,360118,7,0,895,486828,0
Total reachable state count : 203077057

Verifying 1 reachability properties.
Reachability property FireWire-PT-17-ReachabilityFireability-2024-00 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
FireWire-PT-17-ReachabilityFireability-2024-00,5808,10.6203,116196,2,757,19,360118,7,0,933,486828,0
Over-approximation ignoring read arcs solved 0 properties in 11039 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 23:04:55] [INFO ] Flatten gal took : 33 ms
[2024-06-02 23:04:55] [INFO ] Applying decomposition
[2024-06-02 23:04:55] [INFO ] Flatten gal took : 27 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/graph9981925407137090025.txt' '-o' '/tmp/graph9981925407137090025.bin' '-w' '/tmp/graph9981925407137090025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9981925407137090025.bin' '-l' '-1' '-v' '-w' '/tmp/graph9981925407137090025.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:04:55] [INFO ] Decomposing Gal with order
[2024-06-02 23:04:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:04:56] [INFO ] Removed a total of 542 redundant transitions.
[2024-06-02 23:04:56] [INFO ] Flatten gal took : 83 ms
[2024-06-02 23:04:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 18 ms.
[2024-06-02 23:04:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5052580307389057569.gal : 9 ms
[2024-06-02 23:04:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16062708276224926984.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/ReachabilityCardinality5052580307389057569.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16062708276224926984.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/ReachabilityCardinality16062708276224926984.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 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 2699
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2699 after 886859
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :886859 after 1.98161e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.28378e+08 after 1.26582e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.26582e+09 after 2.84385e+11
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.8703e+12,48.208,1133828,9145,332,1.0888e+06,5919,1288,9.14912e+06,109,27861,0
Total reachable state count : 1870302369374

Verifying 1 reachability properties.
Reachability property FireWire-PT-17-ReachabilityFireability-2024-00 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2024-00 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
FireWire-PT-17-ReachabilityFireability-2024-00,54,48.5241,1133828,151,32,1.0888e+06,5919,1335,9.14912e+06,116,27861,23268
All properties solved without resorting to model-checking.
Total runtime 161524 ms.

BK_STOP 1717369544839

--------------------
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="FireWire-PT-17"
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 FireWire-PT-17, 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 r550-tall-171734899000303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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