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-171734899100326.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-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899100326
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 247K 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-20-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-20-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717374396192

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-03 00:26:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-03 00:26:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:26:37] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-03 00:26:37] [INFO ] Transformed 626 places.
[2024-06-03 00:26:37] [INFO ] Transformed 1031 transitions.
[2024-06-03 00:26:37] [INFO ] Found NUPN structural information;
[2024-06-03 00:26:37] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (10 resets) in 1305 ms. (30 steps per ms) remains 12/14 properties
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (20 resets) in 393 ms. (101 steps per ms) remains 12/12 properties
[2024-06-03 00:26:38] [INFO ] Flatten gal took : 271 ms
BEST_FIRST walk for 40001 steps (19 resets) in 760 ms. (52 steps per ms) remains 12/12 properties
[2024-06-03 00:26:38] [INFO ] Flatten gal took : 166 ms
BEST_FIRST walk for 40001 steps (26 resets) in 236 ms. (168 steps per ms) remains 12/12 properties
[2024-06-03 00:26:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12665292738654927897.gal : 85 ms
BEST_FIRST walk for 40000 steps (40 resets) in 364 ms. (109 steps per ms) remains 12/12 properties
[2024-06-03 00:26:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6672458259342980420.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12665292738654927897.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6672458259342980420.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (43 resets) in 333 ms. (119 steps per ms) remains 12/12 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 40001 steps (14 resets) in 303 ms. (131 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (14 resets) in 265 ms. (150 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality6672458259342980420.prop.
BEST_FIRST walk for 40000 steps (12 resets) in 250 ms. (159 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (35 resets) in 236 ms. (168 steps per ms) remains 11/12 properties
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (23 resets) in 112 ms. (354 steps per ms) remains 10/11 properties
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :3 after 6
BEST_FIRST walk for 40001 steps (24 resets) in 228 ms. (174 steps per ms) remains 10/10 properties
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 24
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :24 after 70
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :70 after 128
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :128 after 529
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :529 after 2266
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :2266 after 3740
BEST_FIRST walk for 40000 steps (12 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :3740 after 11152
// Phase 1: matrix 1031 rows 626 cols
[2024-06-03 00:26:39] [INFO ] Computed 13 invariants in 21 ms
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :11152 after 41651
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :41651 after 68225
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FireWire-PT-20-ReachabilityCardinality-2024-07 is UNSAT
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 527/588 variables, 10/71 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 527/598 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/598 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 38/626 variables, 3/601 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 38/639 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :68225 after 196793
At refinement iteration 8 (OVERLAPS) 1031/1657 variables, 626/1265 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1657 variables, 0/1265 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1657 variables, 0/1265 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1657/1657 variables, and 1265 constraints, problems are : Problem set: 1 solved, 9 unsolved in 1340 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 530/588 variables, 10/68 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 530/598 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Invariant property FireWire-PT-20-ReachabilityCardinality-2024-11 does not hold.
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property FireWire-PT-20-ReachabilityCardinality-2024-04 is true.
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property FireWire-PT-20-ReachabilityCardinality-2024-00 does not hold.
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :196793 after 334115
[2024-06-03 00:26:41] [INFO ] Deduced a trap composed of 115 places in 120 ms of which 17 ms to minimize.
[2024-06-03 00:26:41] [INFO ] Deduced a trap composed of 117 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 2/600 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 0/600 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 38/626 variables, 3/603 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 38/641 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-03 00:26:41] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:26:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-03 00:26:41] [INFO ] Deduced a trap composed of 130 places in 139 ms of which 3 ms to minimize.
[2024-06-03 00:26:42] [INFO ] Deduced a trap composed of 132 places in 139 ms of which 3 ms to minimize.
[2024-06-03 00:26:42] [INFO ] Deduced a trap composed of 118 places in 97 ms of which 2 ms to minimize.
[2024-06-03 00:26:42] [INFO ] Deduced a trap composed of 129 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 6/647 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Invariant property FireWire-PT-20-ReachabilityCardinality-2024-05 does not hold.
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :334115 after 717249
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 0/647 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1031/1657 variables, 626/1273 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1657 variables, 5/1278 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-03 00:26:43] [INFO ] Deduced a trap composed of 122 places in 202 ms of which 3 ms to minimize.
[2024-06-03 00:26:43] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 4 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :717249 after 1.0111e+06
At refinement iteration 12 (INCLUDED_ONLY) 0/1657 variables, 2/1280 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1657 variables, 0/1280 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1657 variables, 0/1280 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1657/1657 variables, and 1280 constraints, problems are : Problem set: 5 solved, 5 unsolved in 3618 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 5/10 constraints, Known Traps: 10/10 constraints]
After SMT, in 5069ms problems are : Problem set: 5 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :1.0111e+06 after 2.49586e+06
Parikh walk visited 0 properties in 4404 ms.
Support contains 32 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Graph (trivial) has 422 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 7 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1871 edges and 617 vertex of which 602 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 602 transition count 908
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 109 rules applied. Total rules applied 221 place count 495 transition count 906
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 228 place count 494 transition count 900
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 234 place count 488 transition count 900
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 234 place count 488 transition count 886
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 262 place count 474 transition count 886
Discarding 84 places :
Symmetric choice reduction at 4 with 84 rule applications. Total rules 346 place count 390 transition count 796
Iterating global reduction 4 with 84 rules applied. Total rules applied 430 place count 390 transition count 796
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 432 place count 390 transition count 794
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 432 place count 390 transition count 788
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 444 place count 384 transition count 788
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 468 place count 360 transition count 670
Iterating global reduction 5 with 24 rules applied. Total rules applied 492 place count 360 transition count 670
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 494 place count 360 transition count 668
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 500 place count 354 transition count 658
Iterating global reduction 6 with 6 rules applied. Total rules applied 506 place count 354 transition count 658
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 6 with 4 rules applied. Total rules applied 510 place count 354 transition count 654
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 512 place count 352 transition count 654
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 515 place count 349 transition count 645
Iterating global reduction 8 with 3 rules applied. Total rules applied 518 place count 349 transition count 645
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 521 place count 346 transition count 639
Iterating global reduction 8 with 3 rules applied. Total rules applied 524 place count 346 transition count 639
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 525 place count 345 transition count 636
Iterating global reduction 8 with 1 rules applied. Total rules applied 526 place count 345 transition count 636
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 527 place count 344 transition count 634
Iterating global reduction 8 with 1 rules applied. Total rules applied 528 place count 344 transition count 634
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 529 place count 343 transition count 631
Iterating global reduction 8 with 1 rules applied. Total rules applied 530 place count 343 transition count 631
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 531 place count 342 transition count 629
Iterating global reduction 8 with 1 rules applied. Total rules applied 532 place count 342 transition count 629
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 630 place count 293 transition count 580
Performed 36 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 8 with 72 rules applied. Total rules applied 702 place count 257 transition count 659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 703 place count 257 transition count 658
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 705 place count 257 transition count 656
Free-agglomeration rule applied 23 times.
Iterating global reduction 9 with 23 rules applied. Total rules applied 728 place count 257 transition count 633
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 32 rules applied. Total rules applied 760 place count 234 transition count 624
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 765 place count 229 transition count 619
Iterating global reduction 10 with 5 rules applied. Total rules applied 770 place count 229 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 771 place count 229 transition count 618
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 793 place count 229 transition count 596
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 797 place count 229 transition count 596
Applied a total of 797 rules in 318 ms. Remains 229 /626 variables (removed 397) and now considering 596/1031 (removed 435) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 331 ms. Remains : 229/626 places, 596/1031 transitions.
RANDOM walk for 40000 steps (1184 resets) in 1127 ms. (35 steps per ms) remains 3/5 properties
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (238 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (239 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (230 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
[2024-06-03 00:26:49] [INFO ] Flow matrix only has 585 transitions (discarded 11 similar events)
// Phase 1: matrix 585 rows 229 cols
[2024-06-03 00:26:49] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:26:49] [INFO ] State equation strengthened by 99 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 158/188 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 27/215 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 585/800 variables, 215/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/800 variables, 99/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/800 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 14/814 variables, 14/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/814 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/814 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 338 constraints, problems are : Problem set: 0 solved, 3 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 99/99 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 158/188 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:26:50] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 27/215 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:26:50] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 585/800 variables, 215/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/800 variables, 99/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/800 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:26:50] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2024-06-03 00:26:50] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/800 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 14/814 variables, 14/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/814 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:26:51] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/814 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/814 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/814 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 346 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1140 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 1529ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 679 ms.
Support contains 30 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 596/596 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 228 transition count 597
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 228 transition count 596
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 227 transition count 596
Applied a total of 4 rules in 40 ms. Remains 227 /229 variables (removed 2) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 227/229 places, 596/596 transitions.
RANDOM walk for 40000 steps (1209 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (230 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (244 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (232 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :2.49586e+06 after 4.06443e+06
Interrupted probabilistic random walk after 555461 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :1 out of 3
Probabilistic random walk after 555461 steps, saw 150918 distinct states, run finished after 3007 ms. (steps per millisecond=184 ) properties seen :1
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-03 00:26:55] [INFO ] Flow matrix only has 585 transitions (discarded 11 similar events)
// Phase 1: matrix 585 rows 227 cols
[2024-06-03 00:26:55] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:26:55] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 157/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/213 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 585/798 variables, 213/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 100/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/812 variables, 14/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/812 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/812 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 337 constraints, problems are : Problem set: 0 solved, 2 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 157/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:26:55] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 27/213 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:26:55] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 585/798 variables, 213/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 100/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/812 variables, 14/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/812 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/812 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/812 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 341 constraints, problems are : Problem set: 0 solved, 2 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1077ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 267 ms.
Support contains 29 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 596/596 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 595
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 226 transition count 595
Applied a total of 2 rules in 33 ms. Remains 226 /227 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 226/227 places, 595/596 transitions.
RANDOM walk for 40000 steps (1186 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (227 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (254 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 565943 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 2
Probabilistic random walk after 565943 steps, saw 154355 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2024-06-03 00:26:59] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
// Phase 1: matrix 584 rows 226 cols
[2024-06-03 00:26:59] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:26:59] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/212 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 584/796 variables, 212/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 100/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/796 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/810 variables, 14/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/810 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 336 constraints, problems are : Problem set: 0 solved, 2 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 226/226 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:27:00] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 27/212 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:27:00] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 584/796 variables, 212/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/796 variables, 100/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:27:00] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/796 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 14/810 variables, 14/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/810 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/810 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/810 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 341 constraints, problems are : Problem set: 0 solved, 2 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 226/226 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1087ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 212 ms.
Support contains 29 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 595/595 transitions.
Applied a total of 0 rules in 12 ms. Remains 226 /226 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 226/226 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 595/595 transitions.
Applied a total of 0 rules in 9 ms. Remains 226 /226 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-03 00:27:01] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-03 00:27:01] [INFO ] Invariant cache hit.
[2024-06-03 00:27:01] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-03 00:27:01] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-03 00:27:01] [INFO ] Invariant cache hit.
[2024-06-03 00:27:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-03 00:27:01] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2024-06-03 00:27:01] [INFO ] Redundant transitions in 41 ms returned []
Running 589 sub problems to find dead transitions.
[2024-06-03 00:27:01] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-03 00:27:01] [INFO ] Invariant cache hit.
[2024-06-03 00:27:01] [INFO ] State equation strengthened by 100 read => feed constraints.
Reachability property FireWire-PT-20-ReachabilityCardinality-2024-12 is true.
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :4.06443e+06 after 2.35025e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-03 00:27:07] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:27:07] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:27:07] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:27:07] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2024-06-03 00:27:08] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-06-03 00:27:08] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-06-03 00:27:08] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-06-03 00:27:08] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2024-06-03 00:27:08] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:27:08] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-03 00:27:09] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 589 unsolved
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :2.35025e+07 after 6.21387e+07
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (OVERLAPS) 584/810 variables, 226/247 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/810 variables, 100/347 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 7 (OVERLAPS) 0/810 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 589 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 347 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 226/226 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 589 unsolved
SDD proceeding with computation,7 properties remain. new max is 262144
SDD size :6.21387e+07 after 9.43669e+07
At refinement iteration 4 (OVERLAPS) 584/810 variables, 226/247 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/810 variables, 100/347 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 589/936 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/810 variables, and 936 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 226/226 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 11/11 constraints]
After SMT, in 61019ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 61040ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61872 ms. Remains : 226/226 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 137 edges and 226 vertex of which 26 / 226 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions (Empty/Sink Transition effects.) removed 116 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 150 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 204 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 203 transition count 444
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 203 transition count 441
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 200 transition count 441
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 17 place count 192 transition count 428
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 192 transition count 428
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 2 with 12 rules applied. Total rules applied 37 place count 192 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 191 transition count 416
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 42 place count 187 transition count 409
Iterating global reduction 4 with 4 rules applied. Total rules applied 46 place count 187 transition count 409
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 48 place count 187 transition count 407
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 50 place count 185 transition count 401
Iterating global reduction 5 with 2 rules applied. Total rules applied 52 place count 185 transition count 401
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 53 place count 184 transition count 399
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 184 transition count 399
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 55 place count 183 transition count 397
Iterating global reduction 5 with 1 rules applied. Total rules applied 56 place count 183 transition count 397
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 57 place count 182 transition count 395
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 182 transition count 395
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 5 with 12 rules applied. Total rules applied 70 place count 176 transition count 389
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 72 place count 174 transition count 385
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 174 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 110 place count 174 transition count 349
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 5 rules applied. Total rules applied 115 place count 174 transition count 344
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 120 place count 169 transition count 344
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 124 place count 167 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 125 place count 167 transition count 341
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 129 place count 165 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 136 place count 165 transition count 336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 136 place count 165 transition count 335
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 138 place count 164 transition count 335
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 140 place count 163 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 141 place count 163 transition count 333
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 143 place count 162 transition count 332
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 144 place count 161 transition count 289
Iterating global reduction 8 with 1 rules applied. Total rules applied 145 place count 161 transition count 289
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 152 place count 161 transition count 282
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 160 place count 154 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 162 place count 154 transition count 279
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 163 place count 154 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 164 place count 153 transition count 278
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 169 place count 153 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 170 place count 153 transition count 277
Applied a total of 170 rules in 253 ms. Remains 153 /226 variables (removed 73) and now considering 277/595 (removed 318) transitions.
Running SMT prover for 1 properties.
[2024-06-03 00:28:03] [INFO ] Flow matrix only has 273 transitions (discarded 4 similar events)
// Phase 1: matrix 273 rows 153 cols
[2024-06-03 00:28:03] [INFO ] Computed 10 invariants in 1 ms
[2024-06-03 00:28:03] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-03 00:28:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-03 00:28:03] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-03 00:28:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-03 00:28:03] [INFO ] After 30ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-03 00:28:03] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-03 00:28:03] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-06-03 00:28:03] [INFO ] Flatten gal took : 32 ms
[2024-06-03 00:28:03] [INFO ] Flatten gal took : 32 ms
[2024-06-03 00:28:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4180311340583648355.gal : 3 ms
[2024-06-03 00:28:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15581168764132572985.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/ReachabilityCardinality4180311340583648355.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15581168764132572985.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/ReachabilityCardinality15581168764132572985.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :22 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 44
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :44 after 50
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :50 after 506
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :506 after 898
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :898 after 1544
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1544 after 2846
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2846 after 35430
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :35430 after 146468
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :146468 after 1.66994e+06
Reachability property FireWire-PT-20-ReachabilityCardinality-2024-14 is true.
Reachability property FireWire-PT-20-ReachabilityCardinality-2024-02 is true.
Reachability property FireWire-PT-20-ReachabilityCardinality-2024-01 is true.
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :9.43669e+07 after 6.84261e+10
Detected timeout of ITS tools.
[2024-06-03 00:28:18] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:28:18] [INFO ] Applying decomposition
[2024-06-03 00:28:18] [INFO ] Flatten gal took : 14 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/graph6206733877690325490.txt' '-o' '/tmp/graph6206733877690325490.bin' '-w' '/tmp/graph6206733877690325490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6206733877690325490.bin' '-l' '-1' '-v' '-w' '/tmp/graph6206733877690325490.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:28:18] [INFO ] Decomposing Gal with order
[2024-06-03 00:28:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:28:18] [INFO ] Removed a total of 338 redundant transitions.
[2024-06-03 00:28:18] [INFO ] Flatten gal took : 62 ms
[2024-06-03 00:28:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 19 ms.
[2024-06-03 00:28:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9205953905019665476.gal : 6 ms
[2024-06-03 00:28:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality752959646133076536.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/ReachabilityCardinality9205953905019665476.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality752959646133076536.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 ...306
Loading property file /tmp/ReachabilityCardinality752959646133076536.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 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 3277
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3277 after 515026
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :515026 after 9.56048e+06
Reachability property FireWire-PT-20-ReachabilityCardinality-2024-13 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,7.9437e+09,1.26613,39604,1073,158,68396,1222,671,129152,113,7063,0
Total reachable state count : 7943696777

Verifying 1 reachability properties.
Reachability property FireWire-PT-20-ReachabilityCardinality-2024-13 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-20-ReachabilityCardinality-2024-13,7560,1.28109,39864,75,41,68396,1222,736,129152,130,7063,0
Over-approximation ignoring read arcs solved 0 properties in 17399 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-03 00:28:20] [INFO ] Flatten gal took : 42 ms
[2024-06-03 00:28:20] [INFO ] Applying decomposition
[2024-06-03 00:28:20] [INFO ] Flatten gal took : 37 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/graph687949543973632754.txt' '-o' '/tmp/graph687949543973632754.bin' '-w' '/tmp/graph687949543973632754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph687949543973632754.bin' '-l' '-1' '-v' '-w' '/tmp/graph687949543973632754.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:28:20] [INFO ] Decomposing Gal with order
[2024-06-03 00:28:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:28:20] [INFO ] Removed a total of 997 redundant transitions.
[2024-06-03 00:28:20] [INFO ] Flatten gal took : 61 ms
[2024-06-03 00:28:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 17 ms.
[2024-06-03 00:28:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8837884399173515669.gal : 9 ms
[2024-06-03 00:28:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2146679206281830434.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/ReachabilityCardinality8837884399173515669.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2146679206281830434.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2146679206281830434.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 6
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6 after 6
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6 after 6
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6 after 110932
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :110932 after 481192
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :481192 after 2.22469e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.22469e+06 after 1.01881e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.01881e+09 after 7.08337e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.69652e+12 after 6.69652e+12
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.6818e+14 after 1.57654e+15
ITS-tools command line returned an error code 137
[2024-06-03 00:46:30] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin124442319351130074
[2024-06-03 00:46:30] [INFO ] Applying decomposition
[2024-06-03 00:46:30] [INFO ] Computing symmetric may disable matrix : 595 transitions.
[2024-06-03 00:46:30] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:46:30] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 00:46:30] [INFO ] Computing symmetric may enable matrix : 595 transitions.
[2024-06-03 00:46:30] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph640271648862758011.txt' '-o' '/tmp/graph640271648862758011.bin' '-w' '/tmp/graph640271648862758011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph640271648862758011.bin' '-l' '-1' '-v' '-w' '/tmp/graph640271648862758011.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:46:30] [INFO ] Decomposing Gal with order
[2024-06-03 00:46:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:46:30] [INFO ] Removed a total of 891 redundant transitions.
[2024-06-03 00:46:30] [INFO ] Flatten gal took : 37 ms
[2024-06-03 00:46:30] [INFO ] Computing Do-Not-Accords matrix : 595 transitions.
[2024-06-03 00:46:30] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 00:46:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 209 labels/synchronizations in 39 ms.
[2024-06-03 00:46:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5335168965689396819.gal : 8 ms
[2024-06-03 00:46:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7970768614311356820.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/ReachabilityCardinality5335168965689396819.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7970768614311356820.prop' '--nowitness'

[2024-06-03 00:46:30] [INFO ] Built C files in 204ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin124442319351130074
Running compilation step : cd /tmp/ltsmin124442319351130074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7970768614311356820.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 265
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :265 after 2993
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2993 after 12145
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :12145 after 28513
Compilation finished in 1774 ms.
Running link step : cd /tmp/ltsmin124442319351130074;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin124442319351130074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FireWirePT20ReachabilityCardinality202413==true'
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :28513 after 2.02217e+07
Reachability property FireWire-PT-20-ReachabilityCardinality-2024-13 is true.
FORMULA FireWire-PT-20-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.49047e+10,473.034,6524188,9711,350,2.52335e+06,7615,1156,7.45988e+07,222,59241,0
Total reachable state count : 64904659607

Verifying 1 reachability properties.
Reachability property FireWire-PT-20-ReachabilityCardinality-2024-13 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-20-ReachabilityCardinality-2024-13,7098,474.117,6524188,102,87,2.52335e+06,7615,1222,7.45988e+07,243,59241,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2257906 ms.

BK_STOP 1717376655313

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-20"
export BK_EXAMINATION="ReachabilityCardinality"
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-20, examination is ReachabilityCardinality"
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-171734899100326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;