Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729200422.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ASLink-PT-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729200422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748613042467

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-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 13:50:43] [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]
[2025-05-30 13:50:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 13:50:43] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2025-05-30 13:50:44] [INFO ] Transformed 4014 places.
[2025-05-30 13:50:44] [INFO ] Transformed 4932 transitions.
[2025-05-30 13:50:44] [INFO ] Found NUPN structural information;
[2025-05-30 13:50:44] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-09b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (52 resets) in 1656 ms. (24 steps per ms) remains 10/14 properties
FORMULA ASLink-PT-09b-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 10/10 properties
[2025-05-30 13:50:45] [INFO ] Flatten gal took : 584 ms
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 200 ms. (199 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 10/10 properties
[2025-05-30 13:50:45] [INFO ] Flatten gal took : 302 ms
// Phase 1: matrix 4932 rows 4014 cols
[2025-05-30 13:50:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12756332171283650941.gal : 90 ms
[2025-05-30 13:50:45] [INFO ] Computed 394 invariants in 183 ms
Excessive predecessor constraint size, skipping predecessor.
[2025-05-30 13:50:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9855346212768649926.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12756332171283650941.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9855346212768649926.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 633/834 variables, 56/257 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality9855346212768649926.prop.
At refinement iteration 3 (INCLUDED_ONLY) 0/834 variables, 633/890 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/834 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 291/1125 variables, 37/927 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1125 variables, 291/1218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1125 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2822/3947 variables, 291/1509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3947 variables, 2822/4331 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3947/8946 variables, and 4331 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5193 ms.
Refiners :[Domain max(s): 3947/4014 constraints, Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 291/301 constraints, State Equation: 0/4014 constraints, PredecessorRefiner: 10/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 633/834 variables, 56/257 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/834 variables, 633/890 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/834 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 291/1125 variables, 37/927 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1125 variables, 291/1218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1125 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2822/3947 variables, 291/1509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3947 variables, 2822/4331 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3947/8946 variables, and 4331 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5018 ms.
Refiners :[Domain max(s): 3947/4014 constraints, Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 291/301 constraints, State Equation: 0/4014 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10564ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 201 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 798 transitions
Trivial Post-agglo rules discarded 798 transitions
Performed 798 trivial Post agglomeration. Transition count delta: 798
Iterating post reduction 0 with 798 rules applied. Total rules applied 798 place count 4014 transition count 4134
Reduce places removed 798 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 828 rules applied. Total rules applied 1626 place count 3216 transition count 4104
Reduce places removed 7 places and 0 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Iterating post reduction 2 with 66 rules applied. Total rules applied 1692 place count 3209 transition count 4045
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 63 rules applied. Total rules applied 1755 place count 3150 transition count 4041
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1756 place count 3149 transition count 4041
Performed 842 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 842 Pre rules applied. Total rules applied 1756 place count 3149 transition count 3199
Deduced a syphon composed of 842 places in 12 ms
Ensure Unique test removed 66 places
Reduce places removed 908 places and 0 transitions.
Iterating global reduction 5 with 1750 rules applied. Total rules applied 3506 place count 2241 transition count 3199
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 5 with 54 rules applied. Total rules applied 3560 place count 2221 transition count 3165
Reduce places removed 34 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 6 with 46 rules applied. Total rules applied 3606 place count 2187 transition count 3153
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 3618 place count 2175 transition count 3153
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 21 Pre rules applied. Total rules applied 3618 place count 2175 transition count 3132
Deduced a syphon composed of 21 places in 24 ms
Ensure Unique test removed 11 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 53 rules applied. Total rules applied 3671 place count 2143 transition count 3132
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 3674 place count 2140 transition count 3132
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 3674 place count 2140 transition count 3118
Deduced a syphon composed of 14 places in 9 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 28 rules applied. Total rules applied 3702 place count 2126 transition count 3118
Discarding 113 places :
Symmetric choice reduction at 9 with 113 rule applications. Total rules 3815 place count 2013 transition count 3005
Iterating global reduction 9 with 113 rules applied. Total rules applied 3928 place count 2013 transition count 3005
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 9 with 6 rules applied. Total rules applied 3934 place count 2012 transition count 3000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3935 place count 2011 transition count 3000
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 33 Pre rules applied. Total rules applied 3935 place count 2011 transition count 2967
Deduced a syphon composed of 33 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 11 with 67 rules applied. Total rules applied 4002 place count 1977 transition count 2967
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 4002 place count 1977 transition count 2966
Deduced a syphon composed of 1 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 4005 place count 1975 transition count 2966
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 4012 place count 1968 transition count 2921
Iterating global reduction 11 with 7 rules applied. Total rules applied 4019 place count 1968 transition count 2921
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 4019 place count 1968 transition count 2918
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 4025 place count 1965 transition count 2918
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 4026 place count 1964 transition count 2910
Iterating global reduction 11 with 1 rules applied. Total rules applied 4027 place count 1964 transition count 2910
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 4028 place count 1963 transition count 2902
Iterating global reduction 11 with 1 rules applied. Total rules applied 4029 place count 1963 transition count 2902
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 4030 place count 1962 transition count 2894
Iterating global reduction 11 with 1 rules applied. Total rules applied 4031 place count 1962 transition count 2894
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 4032 place count 1961 transition count 2886
Iterating global reduction 11 with 1 rules applied. Total rules applied 4033 place count 1961 transition count 2886
Performed 253 Post agglomeration using F-continuation condition.Transition count delta: 253
Deduced a syphon composed of 253 places in 6 ms
Ensure Unique test removed 7 places
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 11 with 513 rules applied. Total rules applied 4546 place count 1701 transition count 2633
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 4547 place count 1700 transition count 2632
Ensure Unique test removed 1 places
Iterating global reduction 11 with 2 rules applied. Total rules applied 4549 place count 1699 transition count 2632
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 4550 place count 1698 transition count 2631
Iterating global reduction 11 with 1 rules applied. Total rules applied 4551 place count 1698 transition count 2631
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 4553 place count 1698 transition count 2629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 4554 place count 1697 transition count 2629
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4556 place count 1696 transition count 2638
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 4558 place count 1696 transition count 2636
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 13 with 4 rules applied. Total rules applied 4562 place count 1694 transition count 2634
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 4564 place count 1692 transition count 2634
Free-agglomeration rule applied 19 times.
Iterating global reduction 15 with 19 rules applied. Total rules applied 4583 place count 1692 transition count 2615
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 15 with 19 rules applied. Total rules applied 4602 place count 1673 transition count 2615
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 16 with 21 rules applied. Total rules applied 4623 place count 1673 transition count 2594
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 16 with 21 rules applied. Total rules applied 4644 place count 1652 transition count 2594
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 4645 place count 1652 transition count 2594
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 4646 place count 1652 transition count 2594
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 4647 place count 1651 transition count 2593
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 4654 place count 1644 transition count 2593
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 15
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 11 Pre rules applied. Total rules applied 4654 place count 1644 transition count 2582
Deduced a syphon composed of 11 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 18 with 23 rules applied. Total rules applied 4677 place count 1632 transition count 2582
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 18 with 3 rules applied. Total rules applied 4680 place count 1629 transition count 2582
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 1 Pre rules applied. Total rules applied 4680 place count 1629 transition count 2581
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 4682 place count 1628 transition count 2581
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :15 after 21
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 19 with 18 rules applied. Total rules applied 4700 place count 1619 transition count 2572
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :21 after 153
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 4702 place count 1617 transition count 2570
Iterating global reduction 19 with 2 rules applied. Total rules applied 4704 place count 1617 transition count 2570
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :153 after 352
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :352 after 960
Free-agglomeration rule applied 2 times.
Iterating global reduction 19 with 2 rules applied. Total rules applied 4706 place count 1617 transition count 2568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 4708 place count 1615 transition count 2568
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :960 after 12499
Applied a total of 4708 rules in 3027 ms. Remains 1615 /4014 variables (removed 2399) and now considering 2568/4932 (removed 2364) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3035 ms. Remains : 1615/4014 places, 2568/4932 transitions.
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :12499 after 32460
RANDOM walk for 40000 steps (259 resets) in 613 ms. (65 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (23 resets) in 301 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 176 ms. (226 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :32460 after 625239
BEST_FIRST walk for 40003 steps (24 resets) in 278 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 263 ms. (151 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (22 resets) in 277 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 298 ms. (133 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 227 ms. (175 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (25 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (22 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :625239 after 7.18249e+10
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :7.18249e+10 after 1.26402e+17
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :1.26402e+17 after 1.14019e+23
Interrupted probabilistic random walk after 129048 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 10
Probabilistic random walk after 129048 steps, saw 28157 distinct states, run finished after 3008 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 2568 rows 1615 cols
[2025-05-30 13:51:03] [INFO ] Computed 270 invariants in 71 ms
[2025-05-30 13:51:03] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 430/628 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 35/663 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/663 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3/666 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 917/1583 variables, 196/259 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1583 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 4/1587 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :1.14019e+23 after 8.92423e+34
At refinement iteration 10 (INCLUDED_ONLY) 0/1587 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 28/1615 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1615 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2568/4183 variables, 1615/1885 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4183 variables, 1/1886 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4183 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/4183 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4183/4183 variables, and 1886 constraints, problems are : Problem set: 0 solved, 10 unsolved in 7250 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 203/203 constraints, State Equation: 1615/1615 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 430/628 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:51:10] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 35/663 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 3/666 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 917/1583 variables, 196/260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:51:12] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:51:12] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:51:13] [INFO ] Deduced a trap composed of 28 places in 339 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:51:13] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:51:14] [INFO ] Deduced a trap composed of 29 places in 354 ms of which 37 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1583 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:51:14] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1583 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :8.92423e+34 after 3.29285e+55
At refinement iteration 11 (INCLUDED_ONLY) 0/1583 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 4/1587 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1587 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 28/1615 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1615 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 2568/4183 variables, 1615/1892 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4183 variables, 1/1893 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4183 variables, 6/1899 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4183 variables, 0/1899 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 0/4183 variables, 0/1899 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4183/4183 variables, and 1899 constraints, problems are : Problem set: 0 solved, 10 unsolved in 35051 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 203/203 constraints, State Equation: 1615/1615 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/6 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42454ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 43603 ms.
Support contains 198 out of 1615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1615/1615 places, 2568/2568 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 1615 transition count 2567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1614 transition count 2567
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 1614 transition count 2566
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 1613 transition count 2566
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1612 transition count 2565
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1612 transition count 2565
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 1611 transition count 2559
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 1611 transition count 2559
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 1611 transition count 2558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1610 transition count 2558
Applied a total of 10 rules in 263 ms. Remains 1610 /1615 variables (removed 5) and now considering 2558/2568 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 1610/1615 places, 2558/2568 transitions.
RANDOM walk for 40000 steps (257 resets) in 422 ms. (94 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (26 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (25 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (25 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 211 ms. (188 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (26 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (24 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (23 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 140741 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 10
Probabilistic random walk after 140741 steps, saw 30196 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
// Phase 1: matrix 2558 rows 1610 cols
[2025-05-30 13:52:33] [INFO ] Computed 270 invariants in 26 ms
[2025-05-30 13:52:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 444/642 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/668 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 908/1576 variables, 195/258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1576 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 4/1580 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 30/1610 variables, 8/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1610 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2558/4168 variables, 1610/1880 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4168 variables, 1/1881 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4168 variables, 0/1881 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/4168 variables, 0/1881 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4168/4168 variables, and 1881 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6438 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 203/203 constraints, State Equation: 1610/1610 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 444/642 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:52:39] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/642 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 26/668 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/668 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 908/1576 variables, 195/259 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:52:40] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:52:41] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:52:41] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:52:42] [INFO ] Deduced a trap composed of 24 places in 360 ms of which 39 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1576 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:52:43] [INFO ] Deduced a trap composed of 21 places in 401 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:52:43] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1576 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:52:44] [INFO ] Deduced a trap composed of 32 places in 460 ms of which 58 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1576 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:52:46] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 18 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1576 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 4/1580 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1580 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 30/1610 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 2558/4168 variables, 1610/1889 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4168 variables, 1/1890 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4168 variables, 6/1896 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4168 variables, 0/1896 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 0/4168 variables, 0/1896 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4168/4168 variables, and 1896 constraints, problems are : Problem set: 0 solved, 10 unsolved in 44772 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 203/203 constraints, State Equation: 1610/1610 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/6 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51289ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 43800 ms.
Support contains 198 out of 1610 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1610/1610 places, 2558/2558 transitions.
Applied a total of 0 rules in 69 ms. Remains 1610 /1610 variables (removed 0) and now considering 2558/2558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1610/1610 places, 2558/2558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1610/1610 places, 2558/2558 transitions.
Applied a total of 0 rules in 63 ms. Remains 1610 /1610 variables (removed 0) and now considering 2558/2558 (removed 0) transitions.
[2025-05-30 13:54:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:54:09] [INFO ] Implicit Places using invariants in 1183 ms returned [1, 18, 35, 53, 72, 148, 165, 167, 172, 186, 187, 189, 206, 224, 266, 286, 310, 321, 325, 326, 337, 340, 341, 343, 360, 379, 420, 450, 461, 468, 472, 473, 489, 518, 537, 608, 617, 633, 651, 652, 654, 672, 692, 735, 756, 791, 807, 813, 835, 853, 919, 943, 955, 970, 973, 975, 1012, 1054, 1076, 1101, 1105, 1106, 1122, 1124, 1126, 1128, 1146, 1165, 1209, 1249, 1264, 1283, 1284, 1286, 1304, 1322, 1362, 1398, 1412, 1419, 1424, 1437, 1438, 1439, 1470, 1472, 1476, 1495, 1496, 1497, 1499, 1514, 1520, 1526, 1532, 1538, 1544, 1550, 1562, 1568, 1574]
[2025-05-30 13:54:09] [INFO ] Actually due to overlaps returned [1470, 1439, 53, 189, 206, 343, 360, 518, 672, 835, 975, 1146, 1304, 1476, 35, 654, 1128, 186, 340, 489, 651, 970, 1124, 1283, 1286, 1437, 1495, 187, 341, 652, 813, 973, 1126, 1284, 1438, 1472, 1496, 1, 325, 326, 472, 473, 633, 791, 955, 1105, 1106, 1264, 1419, 18, 72, 224, 337, 379, 537, 692, 807, 853, 1012, 1122, 1165, 1322, 1497, 1544, 1562, 1574, 165, 172, 266, 420, 450, 461, 608, 943, 1076, 1398, 1424, 1499, 1514, 1520, 1526, 1532, 1538, 1550, 1568]
Discarding 85 places :
Implicit Place search using SMT only with invariants took 1201 ms to find 85 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1525/1610 places, 2558/2558 transitions.
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 1512 transition count 2484
Reduce places removed 74 places and 0 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 1 with 119 rules applied. Total rules applied 206 place count 1438 transition count 2439
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 251 place count 1393 transition count 2439
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 251 place count 1393 transition count 2404
Deduced a syphon composed of 35 places in 4 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 321 place count 1358 transition count 2404
Discarding 4 places :
Implicit places reduction removed 4 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 9 rules applied. Total rules applied 330 place count 1354 transition count 2399
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 335 place count 1349 transition count 2399
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 346 place count 1338 transition count 2388
Iterating global reduction 5 with 11 rules applied. Total rules applied 357 place count 1338 transition count 2388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 358 place count 1338 transition count 2387
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 360 place count 1336 transition count 2384
Iterating global reduction 6 with 2 rules applied. Total rules applied 362 place count 1336 transition count 2384
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 4 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 486 place count 1274 transition count 2322
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 488 place count 1272 transition count 2320
Iterating global reduction 6 with 2 rules applied. Total rules applied 490 place count 1272 transition count 2320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 491 place count 1272 transition count 2319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 493 place count 1271 transition count 2319
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 494 place count 1271 transition count 2318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 495 place count 1270 transition count 2318
Free-agglomeration rule (complex) applied 52 times.
Iterating global reduction 8 with 52 rules applied. Total rules applied 547 place count 1270 transition count 2266
Ensure Unique test removed 2 places
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 8 with 54 rules applied. Total rules applied 601 place count 1216 transition count 2266
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 604 place count 1216 transition count 2263
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 622 place count 1216 transition count 2263
Applied a total of 622 rules in 595 ms. Remains 1216 /1525 variables (removed 309) and now considering 2263/2558 (removed 295) transitions.
// Phase 1: matrix 2263 rows 1216 cols
[2025-05-30 13:54:10] [INFO ] Computed 166 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:54:10] [INFO ] Implicit Places using invariants in 864 ms returned [113, 139, 140, 234, 257, 258, 315, 339, 368, 369, 469, 480, 495, 502, 608, 620, 628, 630, 731, 745, 748, 755, 762, 763, 865, 871, 976, 995, 1002, 1003, 1075, 1090, 1103, 1112, 1115, 1204, 1211]
[2025-05-30 13:54:10] [INFO ] Actually due to overlaps returned [140, 257, 368, 502, 628, 762, 1002, 369, 630, 763, 258, 1003, 113, 234, 469, 731, 748, 976, 1112, 1204, 139, 315, 339, 480, 495, 608, 620, 755, 865, 871, 995, 1075, 1090, 1115, 1211]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 868 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1181/1610 places, 2263/2558 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1181 transition count 2261
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1179 transition count 2261
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 1175 transition count 2257
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 1175 transition count 2257
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 1174 transition count 2256
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 1174 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 1173 transition count 2255
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 1173 transition count 2255
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 1168 transition count 2250
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 27 place count 1168 transition count 2249
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 1168 transition count 2242
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 41 place count 1161 transition count 2242
Applied a total of 41 rules in 237 ms. Remains 1161 /1181 variables (removed 20) and now considering 2242/2263 (removed 21) transitions.
// Phase 1: matrix 2242 rows 1161 cols
[2025-05-30 13:54:11] [INFO ] Computed 131 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:54:11] [INFO ] Implicit Places using invariants in 709 ms returned [1053]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 712 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1160/1610 places, 2242/2558 transitions.
Applied a total of 0 rules in 37 ms. Remains 1160 /1160 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3713 ms. Remains : 1160/1610 places, 2242/2558 transitions.
RANDOM walk for 40000 steps (295 resets) in 963 ms. (41 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (27 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (31 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (31 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (32 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (32 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (29 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (30 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (30 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (30 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (27 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 231450 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 10
Probabilistic random walk after 231450 steps, saw 39829 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 2242 rows 1160 cols
[2025-05-30 13:54:15] [INFO ] Computed 130 invariants in 18 ms
[2025-05-30 13:54:15] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 288/486 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 662/1148 variables, 94/127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1148 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/1149 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1149 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 11/1160 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1160 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2242/3402 variables, 1160/1290 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3402 variables, 2/1292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3402 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/3402 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3402/3402 variables, and 1292 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4483 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 1160/1160 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 288/486 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:20] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:20] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:20] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 662/1148 variables, 94/130 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:21] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:21] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:21] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:21] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:22] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:22] [INFO ] Deduced a trap composed of 26 places in 267 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:22] [INFO ] Deduced a trap composed of 37 places in 306 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:23] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 36 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1148 variables, 8/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:23] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1148 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:24] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1148 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1148 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/1149 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:26] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:26] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:27] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1149 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1149 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 11/1160 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:28] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 12 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1160 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1160 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2242/3402 variables, 1160/1307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3402 variables, 2/1309 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3402 variables, 6/1315 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:38] [INFO ] Deduced a trap composed of 53 places in 317 ms of which 50 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3402 variables, 1/1316 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3402 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:42] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 12 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/3402 variables, 1/1317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:54:57] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3402 variables, 1/1318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3402 variables, 0/1318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 0/3402 variables, 0/1318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3402/3402 variables, and 1318 constraints, problems are : Problem set: 0 solved, 10 unsolved in 47225 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 1160/1160 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/6 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51773ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 34693 ms.
Support contains 198 out of 1160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1160/1160 places, 2242/2242 transitions.
Applied a total of 0 rules in 40 ms. Remains 1160 /1160 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1160/1160 places, 2242/2242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1160/1160 places, 2242/2242 transitions.
Applied a total of 0 rules in 37 ms. Remains 1160 /1160 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
[2025-05-30 13:55:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:55:42] [INFO ] Implicit Places using invariants in 751 ms returned []
[2025-05-30 13:55:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:55:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 13:55:45] [INFO ] Implicit Places using invariants and state equation in 2454 ms returned []
Implicit Place search using SMT with State Equation took 3232 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:55:45] [INFO ] Redundant transitions in 111 ms returned []
Running 2194 sub problems to find dead transitions.
[2025-05-30 13:55:45] [INFO ] Invariant cache hit.
[2025-05-30 13:55:45] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1152 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2194 unsolved
SMT process timed out in 30979ms, After SMT, problems are : Problem set: 0 solved, 2194 unsolved
Search for dead transitions found 0 dead transitions in 30989ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34386 ms. Remains : 1160/1160 places, 2242/2242 transitions.
Attempting over-approximation, by ignoring read arcs.
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 1160 transition count 2241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1159 transition count 2241
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 1159 transition count 2237
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 1155 transition count 2237
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 12 place count 1154 transition count 2236
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 1154 transition count 2234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 1152 transition count 2234
Applied a total of 16 rules in 117 ms. Remains 1152 /1160 variables (removed 8) and now considering 2234/2242 (removed 8) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 2234 rows 1152 cols
[2025-05-30 13:56:16] [INFO ] Computed 130 invariants in 25 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 13:56:16] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 13:56:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2025-05-30 13:56:17] [INFO ] [Nat]Absence check using 34 positive and 96 generalized place invariants in 35 ms returned sat
[2025-05-30 13:56:24] [INFO ] After 6901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:24] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 21 ms to minimize.
[2025-05-30 13:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:28] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 9 ms to minimize.
[2025-05-30 13:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:29] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:29] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 14 ms to minimize.
[2025-05-30 13:56:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 546 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:30] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 11 ms to minimize.
[2025-05-30 13:56:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:32] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 20 ms to minimize.
[2025-05-30 13:56:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:35] [INFO ] Deduced a trap composed of 24 places in 494 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:36] [INFO ] Deduced a trap composed of 74 places in 416 ms of which 68 ms to minimize.
[2025-05-30 13:56:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1128 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:37] [INFO ] Deduced a trap composed of 51 places in 410 ms of which 51 ms to minimize.
[2025-05-30 13:56:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 549 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:41] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 7 ms to minimize.
[2025-05-30 13:56:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:43] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 13 ms to minimize.
[2025-05-30 13:56:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:51] [INFO ] Deduced a trap composed of 38 places in 316 ms of which 57 ms to minimize.
[2025-05-30 13:56:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 471 ms
TRAPS : Iteration 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:56] [INFO ] Deduced a trap composed of 73 places in 217 ms of which 31 ms to minimize.
[2025-05-30 13:56:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
TRAPS : Iteration 5
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:00] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 19 ms to minimize.
[2025-05-30 13:57:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
TRAPS : Iteration 6
[2025-05-30 13:57:08] [INFO ] After 51218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2025-05-30 13:57:14] [INFO ] After 57696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 58197 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 13:57:14] [INFO ] Flatten gal took : 142 ms
[2025-05-30 13:57:14] [INFO ] Applying decomposition
[2025-05-30 13:57:15] [INFO ] Flatten gal took : 139 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16400983349737007858.txt' '-o' '/tmp/graph16400983349737007858.bin' '-w' '/tmp/graph16400983349737007858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16400983349737007858.bin' '-l' '-1' '-v' '-w' '/tmp/graph16400983349737007858.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:57:15] [INFO ] Decomposing Gal with order
[2025-05-30 13:57:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:57:16] [INFO ] Removed a total of 3508 redundant transitions.
[2025-05-30 13:57:16] [INFO ] Flatten gal took : 308 ms
[2025-05-30 13:57:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 49 ms.
[2025-05-30 13:57:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16430977980276537014.gal : 43 ms
[2025-05-30 13:57:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13705367089741709917.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16430977980276537014.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13705367089741709917.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13705367089741709917.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :1 after 6.62466e+08
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :6.62466e+08 after 1.19582e+28
Detected timeout of ITS tools.
[2025-05-30 14:27:17] [INFO ] Flatten gal took : 68 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1365911030092812038
[2025-05-30 14:27:17] [INFO ] Too many transitions (2242) to apply POR reductions. Disabling POR matrices.
[2025-05-30 14:27:17] [INFO ] Applying decomposition
[2025-05-30 14:27:17] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1365911030092812038
Running compilation step : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '72' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 14:27:17] [INFO ] Flatten gal took : 101 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6121783698819914523.txt' '-o' '/tmp/graph6121783698819914523.bin' '-w' '/tmp/graph6121783698819914523.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6121783698819914523.bin' '-l' '-1' '-v' '-w' '/tmp/graph6121783698819914523.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:27:18] [INFO ] Decomposing Gal with order
[2025-05-30 14:27:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:27:18] [INFO ] Removed a total of 3793 redundant transitions.
[2025-05-30 14:27:18] [INFO ] Flatten gal took : 109 ms
[2025-05-30 14:27:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 43 ms.
[2025-05-30 14:27:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6391280454952802114.gal : 31 ms
[2025-05-30 14:27:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8316158294565481033.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6391280454952802114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8316158294565481033.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8316158294565481033.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :1 after 6
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :6 after 18083
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :18083 after 1.07203e+13
Compilation finished in 5258 ms.
Running link step : cd /tmp/ltsmin1365911030092812038;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202401==true'
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :1.07203e+13 after 8.07706e+18
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :8.07706e+18 after 1.20944e+20
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202302==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202302==true'
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202503==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202503==true'
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202405==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202405==true'
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202507==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202507==true'
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202509==true'
Reachability property ASLink-PT-09b-ReachabilityCardinality-2025-10 is true.
FORMULA ASLink-PT-09b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202509==true'
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202511==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202511==true'
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202513==true'
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :1.20944e+20 after 1.91781e+22
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202513==true'
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202515==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202515==true'
Retrying LTSmin with larger timeout 2880 s
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202401==true'
WARNING : LTSmin timed out (>288 s) on command cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202302==true'
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :1.91781e+22 after 7.96227e+22
WARNING : LTSmin timed out (>288 s) on command cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202302==true'
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202503==true'
WARNING : LTSmin timed out (>288 s) on command cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202503==true'
Running LTSmin : cd /tmp/ltsmin1365911030092812038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityCardinality202405==true'

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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-09b"
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-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-09b, 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 r002-tall-174853729200422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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