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.r004-smll-171620117800102.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 ASLink-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117800102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 921K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716306571181

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 15:49:32] [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-05-21 15:49:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:49:33] [INFO ] Load time of PNML (sax parser for PT used): 376 ms
[2024-05-21 15:49:33] [INFO ] Transformed 2826 places.
[2024-05-21 15:49:33] [INFO ] Transformed 3513 transitions.
[2024-05-21 15:49:33] [INFO ] Found NUPN structural information;
[2024-05-21 15:49:33] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 642 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 183 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (66 resets) in 2758 ms. (14 steps per ms) remains 9/13 properties
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 616 ms. (64 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 246 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (10 resets) in 430 ms. (92 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 230 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 208 ms. (191 steps per ms) remains 9/9 properties
[2024-05-21 15:49:35] [INFO ] Flatten gal took : 821 ms
// Phase 1: matrix 3513 rows 2826 cols
[2024-05-21 15:49:36] [INFO ] Flatten gal took : 307 ms
[2024-05-21 15:49:36] [INFO ] Computed 277 invariants in 271 ms
[2024-05-21 15:49:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4992256013795041858.gal : 151 ms
[2024-05-21 15:49:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17243145748133001263.prop : 4 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/ReachabilityCardinality4992256013795041858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17243145748133001263.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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 465/581 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 465/615 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 194/775 variables, 31/646 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Loading property file /tmp/ReachabilityCardinality17243145748133001263.prop.
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 194/840 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2014/2789 variables, 203/1043 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2789 variables, 2014/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2789 variables, 0/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 37/2826 variables, 9/3066 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2826 variables, 37/3103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2826 variables, 0/3103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6339/6339 variables, and 5929 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5075 ms.
Refiners :[Domain max(s): 2826/2826 constraints, Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 212/212 constraints, State Equation: 2826/2826 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 465/581 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 465/615 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 194/775 variables, 31/646 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 194/840 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2014/2789 variables, 203/1043 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2789 variables, 2014/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 15:49:45] [INFO ] Deduced a trap composed of 28 places in 1736 ms of which 183 ms to minimize.
[2024-05-21 15:49:46] [INFO ] Deduced a trap composed of 23 places in 1374 ms of which 17 ms to minimize.
SMT process timed out in 10724ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 116 out of 2826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 563 transitions
Trivial Post-agglo rules discarded 563 transitions
Performed 563 trivial Post agglomeration. Transition count delta: 563
Iterating post reduction 0 with 563 rules applied. Total rules applied 563 place count 2826 transition count 2950
Reduce places removed 563 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 586 rules applied. Total rules applied 1149 place count 2263 transition count 2927
Reduce places removed 4 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 28 rules applied. Total rules applied 1177 place count 2259 transition count 2903
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1201 place count 2235 transition count 2903
Performed 611 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 611 Pre rules applied. Total rules applied 1201 place count 2235 transition count 2292
Deduced a syphon composed of 611 places in 8 ms
Ensure Unique test removed 44 places
Reduce places removed 655 places and 0 transitions.
Iterating global reduction 4 with 1266 rules applied. Total rules applied 2467 place count 1580 transition count 2292
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 4 with 46 rules applied. Total rules applied 2513 place count 1565 transition count 2261
Reduce places removed 31 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 5 with 37 rules applied. Total rules applied 2550 place count 1534 transition count 2255
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2556 place count 1528 transition count 2255
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 2556 place count 1528 transition count 2242
Deduced a syphon composed of 13 places in 7 ms
Ensure Unique test removed 8 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 2590 place count 1507 transition count 2242
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 2591 place count 1506 transition count 2242
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 2591 place count 1506 transition count 2235
Deduced a syphon composed of 7 places in 17 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 2605 place count 1499 transition count 2235
Discarding 89 places :
Symmetric choice reduction at 8 with 89 rule applications. Total rules 2694 place count 1410 transition count 2146
Iterating global reduction 8 with 89 rules applied. Total rules applied 2783 place count 1410 transition count 2146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2784 place count 1410 transition count 2145
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 28 Pre rules applied. Total rules applied 2784 place count 1410 transition count 2117
Deduced a syphon composed of 28 places in 16 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 9 with 57 rules applied. Total rules applied 2841 place count 1381 transition count 2117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2841 place count 1381 transition count 2116
Deduced a syphon composed of 1 places in 17 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2844 place count 1379 transition count 2116
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2850 place count 1373 transition count 2077
Iterating global reduction 9 with 6 rules applied. Total rules applied 2856 place count 1373 transition count 2077
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 2856 place count 1373 transition count 2074
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 2862 place count 1370 transition count 2074
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :12 after 18
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :18 after 290
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2863 place count 1369 transition count 2066
Iterating global reduction 9 with 1 rules applied. Total rules applied 2864 place count 1369 transition count 2066
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :290 after 390
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :390 after 803
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2865 place count 1368 transition count 2058
Iterating global reduction 9 with 1 rules applied. Total rules applied 2866 place count 1368 transition count 2058
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :803 after 26854
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :26854 after 109776
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 6 ms
Ensure Unique test removed 8 places
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 9 with 368 rules applied. Total rules applied 3234 place count 1180 transition count 1878
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :109776 after 898971
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3235 place count 1179 transition count 1877
Iterating global reduction 9 with 1 rules applied. Total rules applied 3236 place count 1179 transition count 1877
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3238 place count 1178 transition count 1886
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 3239 place count 1178 transition count 1885
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 3241 place count 1177 transition count 1884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3242 place count 1176 transition count 1884
Free-agglomeration rule applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 3251 place count 1176 transition count 1875
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3260 place count 1167 transition count 1875
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 12 with 10 rules applied. Total rules applied 3270 place count 1167 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 3280 place count 1157 transition count 1865
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :898971 after 1.46003e+11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 3281 place count 1156 transition count 1864
Reduce places removed 7 places and 0 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 13 with 8 rules applied. Total rules applied 3289 place count 1149 transition count 1863
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3290 place count 1148 transition count 1863
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 11 Pre rules applied. Total rules applied 3290 place count 1148 transition count 1852
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 3312 place count 1137 transition count 1852
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 15 with 4 rules applied. Total rules applied 3316 place count 1133 transition count 1852
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 3317 place count 1132 transition count 1851
Iterating global reduction 16 with 1 rules applied. Total rules applied 3318 place count 1132 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 3319 place count 1131 transition count 1850
Iterating global reduction 16 with 1 rules applied. Total rules applied 3320 place count 1131 transition count 1850
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 3321 place count 1130 transition count 1849
Iterating global reduction 16 with 1 rules applied. Total rules applied 3322 place count 1130 transition count 1849
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 3323 place count 1130 transition count 1848
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 17 with 14 rules applied. Total rules applied 3337 place count 1123 transition count 1841
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 3339 place count 1121 transition count 1839
Iterating global reduction 17 with 2 rules applied. Total rules applied 3341 place count 1121 transition count 1839
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 3342 place count 1121 transition count 1838
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3343 place count 1120 transition count 1838
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :1.46003e+11 after 5.8811e+11
Applied a total of 3343 rules in 2236 ms. Remains 1120 /2826 variables (removed 1706) and now considering 1838/3513 (removed 1675) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2253 ms. Remains : 1120/2826 places, 1838/3513 transitions.
RANDOM walk for 40000 steps (297 resets) in 666 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (44 resets) in 234 ms. (170 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 267 ms. (149 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (43 resets) in 180 ms. (221 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (48 resets) in 151 ms. (263 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (50 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (49 resets) in 308 ms. (129 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (29 resets) in 280 ms. (142 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :5.8811e+11 after 5.11327e+17
Interrupted probabilistic random walk after 106779 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 9
Probabilistic random walk after 106779 steps, saw 30919 distinct states, run finished after 3013 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 1838 rows 1120 cols
[2024-05-21 15:49:52] [INFO ] Computed 187 invariants in 98 ms
[2024-05-21 15:49:52] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 324/440 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 10/450 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 647/1097 variables, 135/174 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1097 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 7/1104 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1104 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 16/1120 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1120 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :5.11327e+17 after 1.83408e+33
At refinement iteration 11 (OVERLAPS) 1838/2958 variables, 1120/1307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2958 variables, 2/1309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2958 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/2958 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2958/2958 variables, and 1309 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3607 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 1120/1120 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 324/440 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 10/450 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 647/1097 variables, 135/174 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 15:49:59] [INFO ] Deduced a trap composed of 81 places in 1100 ms of which 7 ms to minimize.
[2024-05-21 15:50:00] [INFO ] Deduced a trap composed of 82 places in 723 ms of which 7 ms to minimize.
[2024-05-21 15:50:01] [INFO ] Deduced a trap composed of 77 places in 1176 ms of which 7 ms to minimize.
[2024-05-21 15:50:02] [INFO ] Deduced a trap composed of 74 places in 776 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1097 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1097 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 7/1104 variables, 7/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1104 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 16/1120 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1120 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Reachability property ASLink-PT-06b-ReachabilityCardinality-2024-13 is true.
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 12 (OVERLAPS) 1838/2958 variables, 1120/1311 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2958 variables, 2/1313 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2958 variables, 8/1321 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2958 variables, 0/1321 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/2958 variables, 0/1321 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2958/2958 variables, and 1321 constraints, problems are : Problem set: 1 solved, 8 unsolved in 27665 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 1120/1120 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 31467ms problems are : Problem set: 1 solved, 8 unsolved
Parikh walk visited 0 properties in 30003 ms.
Support contains 113 out of 1120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1120/1120 places, 1838/1838 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 1 place count 1120 transition count 1837
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1119 transition count 1837
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1119 transition count 1836
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1118 transition count 1836
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1117 transition count 1835
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1117 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 1116 transition count 1834
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 1116 transition count 1834
Applied a total of 9 rules in 185 ms. Remains 1116 /1120 variables (removed 4) and now considering 1834/1838 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 1116/1120 places, 1834/1838 transitions.
RANDOM walk for 40000 steps (313 resets) in 418 ms. (95 steps per ms) remains 7/8 properties
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (50 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (46 resets) in 136 ms. (292 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (49 resets) in 225 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (42 resets) in 204 ms. (195 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (50 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (30 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
// Phase 1: matrix 1834 rows 1116 cols
[2024-05-21 15:50:55] [INFO ] Computed 187 invariants in 40 ms
[2024-05-21 15:50:55] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 326/412 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 11/423 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 654/1077 variables, 131/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 7/1084 variables, 7/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1084 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 29/1113 variables, 10/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1113 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1832/2945 variables, 1113/1299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2945 variables, 0/1299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1/2946 variables, 2/1301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2946 variables, 0/1301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 3/2949 variables, 2/1303 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2949 variables, 0/1303 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 1/2950 variables, 1/1304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2950 variables, 1/1305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2950 variables, 0/1305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/2950 variables, 0/1305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2950/2950 variables, and 1305 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4303 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 1116/1116 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 326/412 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 15:50:59] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 11/423 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 654/1077 variables, 131/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 15:51:00] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:51:00] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 3 ms to minimize.
[2024-05-21 15:51:00] [INFO ] Deduced a trap composed of 73 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:51:00] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 2 ms to minimize.
[2024-05-21 15:51:01] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 3 ms to minimize.
[2024-05-21 15:51:01] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1077 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1077 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 7/1084 variables, 7/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1084 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 29/1113 variables, 10/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1113 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1832/2945 variables, 1113/1306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2945 variables, 7/1313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2945 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1/2946 variables, 2/1315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2946 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 3/2949 variables, 2/1317 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2949 variables, 0/1317 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 1/2950 variables, 1/1318 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2950 variables, 1/1319 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2950 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/2950 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2950/2950 variables, and 1319 constraints, problems are : Problem set: 0 solved, 7 unsolved in 63875 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 1116/1116 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 7/7 constraints]
After SMT, in 68312ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 42026 ms.
Support contains 86 out of 1116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 1834/1834 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1116 transition count 1826
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 1108 transition count 1824
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 1106 transition count 1824
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 20 place count 1106 transition count 1807
Deduced a syphon composed of 17 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 56 place count 1087 transition count 1807
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 1085 transition count 1805
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 1085 transition count 1804
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 1084 transition count 1804
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 1084 transition count 1804
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 1083 transition count 1803
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 1082 transition count 1803
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 65 place count 1082 transition count 1802
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 67 place count 1081 transition count 1802
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 68 place count 1080 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 69 place count 1079 transition count 1801
Iterating global reduction 6 with 1 rules applied. Total rules applied 70 place count 1079 transition count 1801
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 71 place count 1078 transition count 1800
Iterating global reduction 6 with 1 rules applied. Total rules applied 72 place count 1078 transition count 1800
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 73 place count 1078 transition count 1800
Applied a total of 73 rules in 383 ms. Remains 1078 /1116 variables (removed 38) and now considering 1800/1834 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 1078/1116 places, 1800/1834 transitions.
RANDOM walk for 40000 steps (369 resets) in 552 ms. (72 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (57 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (51 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (53 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (55 resets) in 208 ms. (191 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (54 resets) in 197 ms. (202 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (54 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (34 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 199933 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 7
Probabilistic random walk after 199933 steps, saw 36112 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 1800 rows 1078 cols
[2024-05-21 15:52:49] [INFO ] Computed 183 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 313/399 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 11/410 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 634/1044 variables, 128/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1044 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 7/1051 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1051 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 27/1078 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1078 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1800/2878 variables, 1078/1261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 0/1261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/2878 variables, 0/1261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2878/2878 variables, and 1261 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3000 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 137/137 constraints, State Equation: 1078/1078 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 313/399 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 15:52:52] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 11/410 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 634/1044 variables, 128/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 15:52:53] [INFO ] Deduced a trap composed of 78 places in 664 ms of which 7 ms to minimize.
[2024-05-21 15:52:54] [INFO ] Deduced a trap composed of 76 places in 646 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1044 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1044 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 7/1051 variables, 7/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1051 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 27/1078 variables, 9/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1078 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1800/2878 variables, 1078/1264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 7/1271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2878 variables, 0/1271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/2878 variables, 0/1271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2878/2878 variables, and 1271 constraints, problems are : Problem set: 0 solved, 7 unsolved in 40258 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 137/137 constraints, State Equation: 1078/1078 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 43330ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 37611 ms.
Support contains 86 out of 1078 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1078/1078 places, 1800/1800 transitions.
Applied a total of 0 rules in 41 ms. Remains 1078 /1078 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1078/1078 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1078/1078 places, 1800/1800 transitions.
Applied a total of 0 rules in 42 ms. Remains 1078 /1078 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-21 15:54:10] [INFO ] Invariant cache hit.
[2024-05-21 15:54:11] [INFO ] Implicit Places using invariants in 1146 ms returned [1, 20, 21, 22, 39, 58, 78, 99, 119, 157, 165, 166, 179, 180, 181, 183, 200, 219, 297, 300, 305, 306, 317, 318, 320, 337, 356, 397, 431, 438, 444, 448, 449, 460, 462, 464, 482, 575, 586, 593, 611, 612, 633, 652, 728, 741, 742, 753, 756, 757, 759, 776, 794, 837, 854, 879, 884, 898, 899, 900, 934, 937, 941, 959, 960, 961, 962, 964, 978, 990, 996, 1002, 1008, 1014, 1020, 1026, 1032, 1038]
[2024-05-21 15:54:11] [INFO ] Actually due to overlaps returned [934, 900, 58, 183, 200, 320, 337, 482, 633, 776, 941, 39, 464, 759, 959, 180, 317, 460, 611, 756, 898, 20, 181, 318, 462, 612, 757, 899, 937, 960, 1, 305, 306, 448, 449, 593, 741, 742, 753, 879, 179, 219, 356, 652, 794, 962, 1008, 1026, 1038, 21, 22, 78, 99, 119, 157, 165, 166, 297, 438, 586, 854, 884, 961, 964, 978, 990, 996, 1002, 1014, 1020, 1032]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 1163 ms to find 71 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1007/1078 places, 1800/1800 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 1001 transition count 1719
Reduce places removed 81 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 97 rules applied. Total rules applied 184 place count 920 transition count 1703
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 200 place count 904 transition count 1703
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 200 place count 904 transition count 1677
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 252 place count 878 transition count 1677
Discarding 3 places :
Implicit places reduction removed 3 places
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 3 with 8 rules applied. Total rules applied 260 place count 875 transition count 1672
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 265 place count 870 transition count 1672
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 276 place count 859 transition count 1661
Iterating global reduction 5 with 11 rules applied. Total rules applied 287 place count 859 transition count 1661
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 288 place count 859 transition count 1660
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 288 place count 859 transition count 1659
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 290 place count 858 transition count 1659
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 292 place count 856 transition count 1655
Iterating global reduction 6 with 2 rules applied. Total rules applied 294 place count 856 transition count 1655
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 4 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 6 with 104 rules applied. Total rules applied 398 place count 804 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 399 place count 803 transition count 1602
Iterating global reduction 6 with 1 rules applied. Total rules applied 400 place count 803 transition count 1602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 401 place count 803 transition count 1601
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 405 place count 801 transition count 1604
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 407 place count 801 transition count 1602
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 409 place count 799 transition count 1602
Free-agglomeration rule (complex) applied 34 times.
Iterating global reduction 8 with 34 rules applied. Total rules applied 443 place count 799 transition count 1568
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 8 with 35 rules applied. Total rules applied 478 place count 764 transition count 1568
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 480 place count 764 transition count 1566
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 497 place count 764 transition count 1566
Applied a total of 497 rules in 385 ms. Remains 764 /1007 variables (removed 243) and now considering 1566/1800 (removed 234) transitions.
// Phase 1: matrix 1566 rows 764 cols
[2024-05-21 15:54:11] [INFO ] Computed 102 invariants in 20 ms
[2024-05-21 15:54:12] [INFO ] Implicit Places using invariants in 818 ms returned [109, 112, 130, 131, 219, 231, 232, 285, 308, 314, 317, 321, 334, 335, 432, 451, 452, 543, 566, 567, 654, 657, 659, 662, 744, 757, 763]
[2024-05-21 15:54:12] [INFO ] Actually due to overlaps returned [130, 231, 334, 451, 566, 131, 232, 452, 567, 335, 109, 308, 314, 543, 654, 659, 757, 112, 219, 285, 317, 321, 432, 662, 744, 763]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 822 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 738/1078 places, 1566/1800 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 732 transition count 1559
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 732 transition count 1559
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 731 transition count 1558
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 731 transition count 1558
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 24 place count 726 transition count 1553
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 726 transition count 1547
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 720 transition count 1547
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 720 transition count 1546
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 719 transition count 1546
Applied a total of 38 rules in 133 ms. Remains 719 /738 variables (removed 19) and now considering 1546/1566 (removed 20) transitions.
// Phase 1: matrix 1546 rows 719 cols
[2024-05-21 15:54:12] [INFO ] Computed 76 invariants in 23 ms
[2024-05-21 15:54:13] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-21 15:54:13] [INFO ] Invariant cache hit.
[2024-05-21 15:54:15] [INFO ] Implicit Places using invariants and state equation in 2172 ms returned []
Implicit Place search using SMT with State Equation took 2875 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 719/1078 places, 1546/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5421 ms. Remains : 719/1078 places, 1546/1800 transitions.
RANDOM walk for 40000 steps (449 resets) in 1063 ms. (37 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (75 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (69 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (74 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (70 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (62 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (74 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (72 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 224675 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 7
Probabilistic random walk after 224675 steps, saw 48259 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2024-05-21 15:54:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 252/338 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 377/715 variables, 52/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/715 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/718 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/718 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/719 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/719 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1546/2265 variables, 719/795 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2265 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/2265 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2265/2265 variables, and 795 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1908 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 252/338 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 377/715 variables, 52/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 36 places in 400 ms of which 4 ms to minimize.
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/715 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/715 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 3/718 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/718 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/719 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/719 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1546/2265 variables, 719/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2265 variables, 7/805 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 15:55:09] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2265 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2265 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/2265 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2265/2265 variables, and 806 constraints, problems are : Problem set: 0 solved, 7 unsolved in 60271 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 62228ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 45116 ms.
Support contains 86 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1546/1546 transitions.
Applied a total of 0 rules in 26 ms. Remains 719 /719 variables (removed 0) and now considering 1546/1546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 719/719 places, 1546/1546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1546/1546 transitions.
Applied a total of 0 rules in 26 ms. Remains 719 /719 variables (removed 0) and now considering 1546/1546 (removed 0) transitions.
[2024-05-21 15:56:06] [INFO ] Invariant cache hit.
[2024-05-21 15:56:07] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-21 15:56:07] [INFO ] Invariant cache hit.
[2024-05-21 15:56:09] [INFO ] Implicit Places using invariants and state equation in 2140 ms returned []
Implicit Place search using SMT with State Equation took 2818 ms to find 0 implicit places.
[2024-05-21 15:56:09] [INFO ] Redundant transitions in 131 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-05-21 15:56:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/716 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/716 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-21 15:56:33] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 716/2265 variables, and 65 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 16/23 constraints, Generalized P Invariants (flows): 48/53 constraints, State Equation: 0/719 constraints, PredecessorRefiner: 1511/1511 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/716 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/716 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
Problem TDEAD1171 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/716 variables, 1/65 constraints. Problems are: Problem set: 1 solved, 1510 unsolved
[2024-05-21 15:56:44] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:56:56] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 3 ms to minimize.
[2024-05-21 15:56:57] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:57:03] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 4 ms to minimize.
[2024-05-21 15:57:03] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
Problem TDEAD879 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD886 is UNSAT
[2024-05-21 15:57:11] [INFO ] Deduced a trap composed of 54 places in 245 ms of which 4 ms to minimize.
SMT process timed out in 61434ms, After SMT, problems are : Problem set: 1 solved, 1510 unsolved
Search for dead transitions found 5 dead transitions in 61459ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 719/719 places, 1541/1546 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 719 transition count 1541
Applied a total of 1 rules in 52 ms. Remains 719 /719 variables (removed 0) and now considering 1541/1541 (removed 0) transitions.
// Phase 1: matrix 1541 rows 719 cols
[2024-05-21 15:57:11] [INFO ] Computed 76 invariants in 18 ms
[2024-05-21 15:57:12] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-21 15:57:12] [INFO ] Invariant cache hit.
[2024-05-21 15:57:14] [INFO ] Implicit Places using invariants and state equation in 2414 ms returned []
Implicit Place search using SMT with State Equation took 3073 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 719/719 places, 1541/1546 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 67580 ms. Remains : 719/719 places, 1541/1546 transitions.
RANDOM walk for 40000 steps (466 resets) in 744 ms. (53 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (72 resets) in 264 ms. (150 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (70 resets) in 371 ms. (107 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (65 resets) in 309 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (72 resets) in 447 ms. (89 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (75 resets) in 480 ms. (83 steps per ms) remains 6/7 properties
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (71 resets) in 425 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (65 resets) in 398 ms. (100 steps per ms) remains 6/6 properties
[2024-05-21 15:57:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 242/304 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/314 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 393/707 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 8/715 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/715 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4/719 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/719 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1541/2260 variables, 719/795 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2260 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2260 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2260/2260 variables, and 795 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1588 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 242/304 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/314 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:57:17] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 4 ms to minimize.
[2024-05-21 15:57:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 393/707 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:57:17] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/707 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 8/715 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/715 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 4/719 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1541/2260 variables, 719/798 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2260 variables, 6/804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2260 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2260 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2260/2260 variables, and 804 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9772 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 11383ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 62 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1541/1541 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 719 transition count 1530
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 708 transition count 1530
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 22 place count 708 transition count 1511
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 60 place count 689 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 688 transition count 1510
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 688 transition count 1510
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 687 transition count 1509
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 65 place count 687 transition count 1508
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 687 transition count 1508
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 686 transition count 1507
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 686 transition count 1507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 686 transition count 1506
Applied a total of 69 rules in 157 ms. Remains 686 /719 variables (removed 33) and now considering 1506/1541 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 686/719 places, 1506/1541 transitions.
RANDOM walk for 40000 steps (496 resets) in 1562 ms. (25 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 339 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (81 resets) in 326 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (77 resets) in 515 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 346 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (76 resets) in 358 ms. (111 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 209431 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 6
Probabilistic random walk after 209431 steps, saw 43325 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
// Phase 1: matrix 1506 rows 686 cols
[2024-05-21 15:58:01] [INFO ] Computed 76 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 185/247 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/259 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 414/673 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 8/681 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 5/686 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/686 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1506/2192 variables, 686/762 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2192 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2192 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2192/2192 variables, and 762 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1979 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 686/686 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 185/247 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/259 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 414/673 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:58:04] [INFO ] Deduced a trap composed of 29 places in 414 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 8/681 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:58:04] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/681 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 5/686 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1506/2192 variables, 686/764 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2192 variables, 6/770 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:58:16] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2192 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2192 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/2192 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2192/2192 variables, and 771 constraints, problems are : Problem set: 0 solved, 6 unsolved in 38472 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 686/686 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 40486ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 42978 ms.
Support contains 40 out of 686 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 686/686 places, 1506/1506 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 686 transition count 1496
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 676 transition count 1495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 675 transition count 1495
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 22 place count 675 transition count 1484
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 44 place count 664 transition count 1484
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 53 place count 659 transition count 1480
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 659 transition count 1479
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 54 place count 659 transition count 1478
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 658 transition count 1478
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 57 place count 657 transition count 1476
Iterating global reduction 4 with 1 rules applied. Total rules applied 58 place count 657 transition count 1476
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 657 transition count 1475
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 61 place count 656 transition count 1474
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 63 place count 656 transition count 1472
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 65 place count 654 transition count 1472
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 67 place count 654 transition count 1470
Applied a total of 67 rules in 154 ms. Remains 654 /686 variables (removed 32) and now considering 1470/1506 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 654/686 places, 1470/1506 transitions.
RANDOM walk for 40000 steps (570 resets) in 1819 ms. (21 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (105 resets) in 341 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (101 resets) in 279 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (97 resets) in 375 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (94 resets) in 418 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (92 resets) in 359 ms. (111 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 162010 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 5
Probabilistic random walk after 162010 steps, saw 52489 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
// Phase 1: matrix 1470 rows 654 cols
[2024-05-21 15:59:29] [INFO ] Computed 75 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 138/178 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 443/621 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 8/629 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 25/654 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1470/2124 variables, 654/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2124 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/2124 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2124/2124 variables, and 729 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1414 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 654/654 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 138/178 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 443/621 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 15:59:31] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 8/629 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 15:59:31] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 25/654 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1470/2124 variables, 654/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2124 variables, 5/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2124 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/2124 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2124/2124 variables, and 736 constraints, problems are : Problem set: 0 solved, 5 unsolved in 11388 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 654/654 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 12839ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 31915 ms.
Support contains 35 out of 654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 654/654 places, 1470/1470 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 654 transition count 1467
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 651 transition count 1467
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 651 transition count 1462
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 17 place count 645 transition count 1462
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 643 transition count 1462
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 643 transition count 1461
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 642 transition count 1461
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 640 transition count 1459
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 640 transition count 1458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 639 transition count 1458
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 639 transition count 1457
Applied a total of 28 rules in 116 ms. Remains 639 /654 variables (removed 15) and now considering 1457/1470 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 639/654 places, 1457/1470 transitions.
RANDOM walk for 40000 steps (588 resets) in 1082 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (112 resets) in 359 ms. (111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (97 resets) in 408 ms. (97 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (97 resets) in 314 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (97 resets) in 486 ms. (82 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 140822 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 4
Probabilistic random walk after 140822 steps, saw 48352 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
// Phase 1: matrix 1457 rows 639 cols
[2024-05-21 16:00:18] [INFO ] Computed 72 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 166/201 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/204 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 404/608 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/616 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 23/639 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1457/2096 variables, 639/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2096 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2096 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2096/2096 variables, and 711 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 639/639 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 166/201 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/204 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 404/608 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:00:19] [INFO ] Deduced a trap composed of 35 places in 351 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 8/616 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:00:20] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:00:20] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/616 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 23/639 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1457/2096 variables, 639/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2096 variables, 4/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2096 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/2096 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2096/2096 variables, and 718 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3995 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 639/639 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 5373ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 30000 ms.
Support contains 35 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1457/1457 transitions.
Applied a total of 0 rules in 23 ms. Remains 639 /639 variables (removed 0) and now considering 1457/1457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 639/639 places, 1457/1457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1457/1457 transitions.
Applied a total of 0 rules in 23 ms. Remains 639 /639 variables (removed 0) and now considering 1457/1457 (removed 0) transitions.
[2024-05-21 16:00:53] [INFO ] Invariant cache hit.
[2024-05-21 16:00:54] [INFO ] Implicit Places using invariants in 837 ms returned [93, 157, 175, 181, 264, 348, 431, 463, 474, 544, 549]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 840 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 628/639 places, 1457/1457 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 628 transition count 1456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 627 transition count 1456
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 623 transition count 1452
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 623 transition count 1452
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 621 transition count 1450
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 621 transition count 1450
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 616 transition count 1445
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 616 transition count 1441
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 612 transition count 1441
Applied a total of 32 rules in 101 ms. Remains 612 /628 variables (removed 16) and now considering 1441/1457 (removed 16) transitions.
// Phase 1: matrix 1441 rows 612 cols
[2024-05-21 16:00:54] [INFO ] Computed 61 invariants in 16 ms
[2024-05-21 16:00:55] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-21 16:00:55] [INFO ] Invariant cache hit.
[2024-05-21 16:00:56] [INFO ] Implicit Places using invariants and state equation in 1695 ms returned [363]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2303 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 611/639 places, 1441/1457 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 611 transition count 1437
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 607 transition count 1437
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 607 transition count 1436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 606 transition count 1436
Applied a total of 10 rules in 52 ms. Remains 606 /611 variables (removed 5) and now considering 1436/1441 (removed 5) transitions.
// Phase 1: matrix 1436 rows 606 cols
[2024-05-21 16:00:56] [INFO ] Computed 60 invariants in 21 ms
[2024-05-21 16:00:57] [INFO ] Implicit Places using invariants in 757 ms returned []
[2024-05-21 16:00:57] [INFO ] Invariant cache hit.
[2024-05-21 16:00:59] [INFO ] Implicit Places using invariants and state equation in 2110 ms returned []
Implicit Place search using SMT with State Equation took 2871 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 606/639 places, 1436/1457 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6191 ms. Remains : 606/639 places, 1436/1457 transitions.
RANDOM walk for 40000 steps (587 resets) in 1130 ms. (35 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (118 resets) in 351 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (106 resets) in 382 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (111 resets) in 336 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (98 resets) in 390 ms. (102 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 122447 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 122447 steps, saw 53808 distinct states, run finished after 3007 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-21 16:01:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 156/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/199 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 385/584 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6/590 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 15/605 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/605 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1436/2041 variables, 605/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2041 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/2042 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2042 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2042 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2042/2042 variables, and 666 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1592 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 606/606 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 156/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/199 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 385/584 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:01:05] [INFO ] Deduced a trap composed of 35 places in 470 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/590 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 15/605 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/605 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1436/2041 variables, 605/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2041 variables, 4/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2041 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/2042 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2042 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/2042 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2042/2042 variables, and 671 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3331 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 606/606 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4939ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 36305 ms.
Support contains 35 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 1436/1436 transitions.
Applied a total of 0 rules in 23 ms. Remains 606 /606 variables (removed 0) and now considering 1436/1436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 606/606 places, 1436/1436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 1436/1436 transitions.
Applied a total of 0 rules in 22 ms. Remains 606 /606 variables (removed 0) and now considering 1436/1436 (removed 0) transitions.
[2024-05-21 16:01:44] [INFO ] Invariant cache hit.
[2024-05-21 16:01:45] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-05-21 16:01:45] [INFO ] Invariant cache hit.
[2024-05-21 16:01:47] [INFO ] Implicit Places using invariants and state equation in 2285 ms returned []
Implicit Place search using SMT with State Equation took 2913 ms to find 0 implicit places.
[2024-05-21 16:01:47] [INFO ] Redundant transitions in 39 ms returned []
Running 1403 sub problems to find dead transitions.
[2024-05-21 16:01:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 36/51 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
[2024-05-21 16:02:11] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 4 ms to minimize.
[2024-05-21 16:02:16] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 604/2042 variables, and 53 constraints, problems are : Problem set: 0 solved, 1403 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/18 constraints, Generalized P Invariants (flows): 36/42 constraints, State Equation: 0/606 constraints, PredecessorRefiner: 1403/1403 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 36/51 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
[2024-05-21 16:02:41] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:02:44] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/604 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/2042 variables, and 55 constraints, problems are : Problem set: 0 solved, 1403 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/18 constraints, Generalized P Invariants (flows): 36/42 constraints, State Equation: 0/606 constraints, PredecessorRefiner: 0/1403 constraints, Known Traps: 4/4 constraints]
After SMT, in 61066ms problems are : Problem set: 0 solved, 1403 unsolved
Search for dead transitions found 0 dead transitions in 61086ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64070 ms. Remains : 606/606 places, 1436/1436 transitions.
Attempting over-approximation, by ignoring read arcs.
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 606 transition count 1435
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 605 transition count 1435
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 605 transition count 1434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 604 transition count 1434
Applied a total of 4 rules in 52 ms. Remains 604 /606 variables (removed 2) and now considering 1434/1436 (removed 2) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1434 rows 604 cols
[2024-05-21 16:02:48] [INFO ] Computed 60 invariants in 15 ms
[2024-05-21 16:02:49] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 16:02:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-21 16:02:49] [INFO ] [Nat]Absence check using 17 positive and 43 generalized place invariants in 30 ms returned sat
[2024-05-21 16:02:50] [INFO ] After 1000ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-21 16:02:51] [INFO ] After 1627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-21 16:02:51] [INFO ] After 2333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-21 16:02:51] [INFO ] Flatten gal took : 121 ms
[2024-05-21 16:02:51] [INFO ] Flatten gal took : 87 ms
[2024-05-21 16:02:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14766301928042529113.gal : 37 ms
[2024-05-21 16:02:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3964752949199508836.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/ReachabilityCardinality14766301928042529113.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3964752949199508836.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/ReachabilityCardinality3964752949199508836.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 28
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :28 after 116
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :116 after 1868
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1868 after 34356
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :34356 after 651224
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :651224 after 8.71936e+07
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :8.71936e+07 after 8.72329e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :8.72329e+07 after 8.72647e+07
Detected timeout of ITS tools.
[2024-05-21 16:03:06] [INFO ] Flatten gal took : 68 ms
[2024-05-21 16:03:06] [INFO ] Applying decomposition
[2024-05-21 16:03:06] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph954554855320674382.txt' '-o' '/tmp/graph954554855320674382.bin' '-w' '/tmp/graph954554855320674382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph954554855320674382.bin' '-l' '-1' '-v' '-w' '/tmp/graph954554855320674382.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:03:07] [INFO ] Decomposing Gal with order
[2024-05-21 16:03:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:03:08] [INFO ] Removed a total of 2812 redundant transitions.
[2024-05-21 16:03:08] [INFO ] Flatten gal took : 410 ms
[2024-05-21 16:03:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 82 ms.
[2024-05-21 16:03:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8101277586536116396.gal : 39 ms
[2024-05-21 16:03:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2804824708495168246.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/ReachabilityCardinality8101277586536116396.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2804824708495168246.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/ReachabilityCardinality2804824708495168246.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :14 after 56
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :56 after 56
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :56 after 84
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :84 after 1.77227e+08
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1.77227e+08 after 2.02247e+08
Invariant property ASLink-PT-06b-ReachabilityCardinality-2024-12 does not hold.
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2.02247e+08 after 2.49698e+10
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2.49698e+10 after 1.20861e+11
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.20861e+11 after 2.79426e+11
Reachability property ASLink-PT-06b-ReachabilityCardinality-2024-06 is true.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.94869e+11 after 5.38391e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 34496 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 16:03:23] [INFO ] Flatten gal took : 129 ms
[2024-05-21 16:03:23] [INFO ] Applying decomposition
[2024-05-21 16:03:23] [INFO ] Flatten gal took : 122 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/graph9880246111685937895.txt' '-o' '/tmp/graph9880246111685937895.bin' '-w' '/tmp/graph9880246111685937895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9880246111685937895.bin' '-l' '-1' '-v' '-w' '/tmp/graph9880246111685937895.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:03:24] [INFO ] Decomposing Gal with order
[2024-05-21 16:03:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:03:25] [INFO ] Removed a total of 2562 redundant transitions.
[2024-05-21 16:03:25] [INFO ] Flatten gal took : 249 ms
[2024-05-21 16:03:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 117 ms.
[2024-05-21 16:03:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15682108682094625275.gal : 39 ms
[2024-05-21 16:03:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14249582471725062127.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/ReachabilityCardinality15682108682094625275.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14249582471725062127.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14249582471725062127.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1 after 282
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :282 after 2.26255e+07
Detected timeout of ITS tools.
[2024-05-21 16:33:25] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1110128890460560024
[2024-05-21 16:33:25] [INFO ] Computing symmetric may disable matrix : 1436 transitions.
[2024-05-21 16:33:25] [INFO ] Applying decomposition
[2024-05-21 16:33:25] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:33:25] [INFO ] Computing symmetric may enable matrix : 1436 transitions.
[2024-05-21 16:33:25] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:33:25] [INFO ] Flatten gal took : 65 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/graph8839268566791986341.txt' '-o' '/tmp/graph8839268566791986341.bin' '-w' '/tmp/graph8839268566791986341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8839268566791986341.bin' '-l' '-1' '-v' '-w' '/tmp/graph8839268566791986341.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:33:25] [INFO ] Decomposing Gal with order
[2024-05-21 16:33:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:33:25] [INFO ] Removed a total of 2809 redundant transitions.
[2024-05-21 16:33:26] [INFO ] Flatten gal took : 103 ms
[2024-05-21 16:33:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 16 ms.
[2024-05-21 16:33:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14105927994093358137.gal : 11 ms
[2024-05-21 16:33:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3204893100041325920.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/ReachabilityCardinality14105927994093358137.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3204893100041325920.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/ReachabilityCardinality3204893100041325920.prop.
[2024-05-21 16:33:26] [INFO ] Computing Do-Not-Accords matrix : 1436 transitions.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 49
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :49 after 580
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :580 after 812
[2024-05-21 16:33:26] [INFO ] Computation of Completed DNA matrix. took 92 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :812 after 50544
[2024-05-21 16:33:26] [INFO ] Built C files in 747ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1110128890460560024
Running compilation step : cd /tmp/ltsmin1110128890460560024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' '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'
Invariant property ASLink-PT-06b-ReachabilityCardinality-2024-12 does not hold.
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.84786e+08 after 3.54706e+08
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.54706e+08 after 6.72239e+09
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :6.72239e+09 after 9.65114e+09
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :9.65114e+09 after 4.59385e+10
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :4.59385e+10 after 2.48214e+11
Reachability property ASLink-PT-06b-ReachabilityCardinality-2024-06 is true.
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6.82737e+11 after 8.3594e+11
Compilation finished in 10798 ms.
Running link step : cd /tmp/ltsmin1110128890460560024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 114 ms.
Running LTSmin : cd /tmp/ltsmin1110128890460560024;'/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' 'ASLinkPT06bReachabilityCardinality202403==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin1110128890460560024;'/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' 'ASLinkPT06bReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin1110128890460560024;'/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' 'ASLinkPT06bReachabilityCardinality202415==true'
Invariant property ASLink-PT-06b-ReachabilityCardinality-2024-03 does not hold.
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.59071e+13 after 2.66524e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.66524e+13 after 1.73853e+14
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin1110128890460560024;'/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' 'ASLinkPT06bReachabilityCardinality202415==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin1110128890460560024;'/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' 'ASLinkPT06bReachabilityCardinality202415==true'
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.80518e+14 after 8.10682e+14

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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//
++ 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 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="ASLink-PT-06b"
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 ASLink-PT-06b, 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 r004-smll-171620117800102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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