About the Execution of ITS-Tools for BridgeAndVehicles-COL-V20P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | TTTT?TTF?FTT?FF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r016-smll-174853764600201.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 BridgeAndVehicles-COL-V20P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853764600201
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 39K 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 BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1748764102312
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202505121319
[2025-06-01 07:48:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 07:48:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 07:48:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-01 07:48:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 07:48:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1076 ms
[2025-06-01 07:48:25] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
[2025-06-01 07:48:25] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 7 ms.
[2025-06-01 07:48:25] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
RANDOM walk for 40000 steps (8 resets) in 2195 ms. (18 steps per ms) remains 39/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 82 ms. (48 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 71 ms. (55 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
// Phase 1: matrix 10 rows 12 cols
[2025-06-01 07:48:27] [INFO ] Computed 4 invariants in 19 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 37 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 37 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 37 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 37 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 37 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 37 solved, 2 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 37 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 37 solved, 2 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/12 variables, 4/4 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/17 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 38 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 17 constraints, problems are : Problem set: 38 solved, 1 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 1/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 791ms problems are : Problem set: 38 solved, 1 unsolved
Finished Parikh walk after 80 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 38 atomic propositions for a total of 15 simplifications.
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 07:48:27] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2025-06-01 07:48:27] [INFO ] Flatten gal took : 21 ms
[2025-06-01 07:48:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 07:48:27] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2025-06-01 07:48:27] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions 4070 arcs in 59 ms.
[2025-06-01 07:48:27] [INFO ] Unfolded 9 HLPN properties in 4 ms.
Support contains 15 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 25 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Running 545 sub problems to find dead transitions.
[2025-06-01 07:48:28] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2025-06-01 07:48:28] [INFO ] Computed 7 invariants in 17 ms
[2025-06-01 07:48:28] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:48:32] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:48:34] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 2/7 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/9 constraints. Problems are: Problem set: 40 solved, 505 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:48:41] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/10 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 40 solved, 505 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 6 (OVERLAPS) 130/198 variables, 68/78 constraints. Problems are: Problem set: 42 solved, 503 unsolved
SMT process timed out in 21355ms, After SMT, problems are : Problem set: 42 solved, 503 unsolved
Search for dead transitions found 42 dead transitions in 21371ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
[2025-06-01 07:48:49] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 68 cols
[2025-06-01 07:48:49] [INFO ] Computed 9 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 07:48:49] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-06-01 07:48:49] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2025-06-01 07:48:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 07:48:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 07:48:49] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 506/548 transitions.
Applied a total of 0 rules in 15 ms. Remains 68 /68 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22009 ms. Remains : 68/68 places, 506/548 transitions.
Support contains 15 out of 68 places after structural reductions.
[2025-06-01 07:48:50] [INFO ] Flatten gal took : 124 ms
[2025-06-01 07:48:50] [INFO ] Flatten gal took : 112 ms
[2025-06-01 07:48:50] [INFO ] Input system was already deterministic with 506 transitions.
RANDOM walk for 40000 steps (224 resets) in 2057 ms. (19 steps per ms) remains 21/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4008 steps (8 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4016 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4007 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
[2025-06-01 07:48:51] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2025-06-01 07:48:51] [INFO ] Invariant cache hit.
[2025-06-01 07:48:51] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 42/57 variables, 4/8 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 126/183 variables, 57/65 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 20/85 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/85 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/194 variables, 11/96 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 1/97 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/97 constraints. Problems are: Problem set: 19 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 97 constraints, problems are : Problem set: 19 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 2 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/15 variables, 4/4 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/57 variables, 4/8 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/183 variables, 57/65 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 20/85 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 1/86 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/86 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/194 variables, 11/97 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/98 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/98 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/194 variables, 0/98 constraints. Problems are: Problem set: 20 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 98 constraints, problems are : Problem set: 20 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 502ms problems are : Problem set: 20 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 506/506 transitions.
Graph (complete) has 554 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 505
Applied a total of 3 rules in 87 ms. Remains 65 /68 variables (removed 3) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2025-06-01 07:48:52] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2025-06-01 07:48:52] [INFO ] Computed 7 invariants in 2 ms
[2025-06-01 07:48:52] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:48:55] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:49:02] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 94 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 502/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 596 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40633ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 40637ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40727 ms. Remains : 65/68 places, 505/506 transitions.
RANDOM walk for 40000 steps (224 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (79 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 809019 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :0 out of 1
Probabilistic random walk after 809019 steps, saw 196899 distinct states, run finished after 3013 ms. (steps per millisecond=268 ) properties seen :0
[2025-06-01 07:49:35] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-06-01 07:49:35] [INFO ] Invariant cache hit.
[2025-06-01 07:49:35] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 41/43 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 132/175 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/177 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/190 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/190 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/43 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 132/175 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/177 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/190 variables, 13/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 521ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 43 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 65/65 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 42 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-06-01 07:49:36] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-06-01 07:49:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 07:49:36] [INFO ] Implicit Places using invariants in 246 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 252 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/65 places, 505/505 transitions.
Applied a total of 0 rules in 30 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 324 ms. Remains : 63/65 places, 505/505 transitions.
RANDOM walk for 40002 steps (224 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (80 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 769213 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 1
Probabilistic random walk after 769213 steps, saw 187440 distinct states, run finished after 3003 ms. (steps per millisecond=256 ) properties seen :0
[2025-06-01 07:49:39] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 63 cols
[2025-06-01 07:49:39] [INFO ] Computed 5 invariants in 3 ms
[2025-06-01 07:49:39] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 41/43 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 130/173 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/175 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/188 variables, 13/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/188 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 88 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/43 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 130/173 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/175 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/188 variables, 13/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 392ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 63/63 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 23 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-06-01 07:49:40] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-06-01 07:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 07:49:40] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-01 07:49:40] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-06-01 07:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 07:49:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 07:49:40] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 07:49:40] [INFO ] Redundant transitions in 52 ms returned []
Running 502 sub problems to find dead transitions.
[2025-06-01 07:49:40] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-06-01 07:49:40] [INFO ] Invariant cache hit.
[2025-06-01 07:49:40] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:49:44] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:49:54] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 90 constraints, problems are : Problem set: 0 solved, 502 unsolved in 27733 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/592 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 592 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58708ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 58712ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59336 ms. Remains : 63/63 places, 505/505 transitions.
Successfully simplified 20 atomic propositions for a total of 9 simplifications.
[2025-06-01 07:50:39] [INFO ] Flatten gal took : 44 ms
[2025-06-01 07:50:39] [INFO ] Flatten gal took : 54 ms
[2025-06-01 07:50:39] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 11 out of 68 places (down from 13) after GAL structural reductions.
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 82 stable transitions
Graph (complete) has 1139 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 506
Applied a total of 2 rules in 22 ms. Remains 66 /68 variables (removed 2) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2025-06-01 07:50:39] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2025-06-01 07:50:39] [INFO ] Computed 7 invariants in 8 ms
[2025-06-01 07:50:39] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:50:43] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 126/192 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/192 variables, and 94 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 126/192 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 503/597 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 597 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40610ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 40613ms
[2025-06-01 07:51:20] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2025-06-01 07:51:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 07:51:20] [INFO ] Implicit Places using invariants in 187 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 189 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 506/506 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40830 ms. Remains : 65/68 places, 506/506 transitions.
[2025-06-01 07:51:20] [INFO ] Flatten gal took : 30 ms
[2025-06-01 07:51:20] [INFO ] Flatten gal took : 34 ms
[2025-06-01 07:51:20] [INFO ] Input system was already deterministic with 506 transitions.
[2025-06-01 07:51:20] [INFO ] Flatten gal took : 32 ms
[2025-06-01 07:51:20] [INFO ] Flatten gal took : 30 ms
[2025-06-01 07:51:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality12882513002720412843.gal : 38 ms
[2025-06-01 07:51:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality13876986374145398576.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12882513002720412843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13876986374145398576.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 07:51:51] [INFO ] Flatten gal took : 23 ms
[2025-06-01 07:51:51] [INFO ] Applying decomposition
[2025-06-01 07:51:51] [INFO ] Flatten gal took : 21 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/graph7286086464551579654.txt' '-o' '/tmp/graph7286086464551579654.bin' '-w' '/tmp/graph7286086464551579654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7286086464551579654.bin' '-l' '-1' '-v' '-w' '/tmp/graph7286086464551579654.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:51:51] [INFO ] Decomposing Gal with order
[2025-06-01 07:51:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:51:51] [INFO ] Removed a total of 492 redundant transitions.
[2025-06-01 07:51:51] [INFO ] Flatten gal took : 301 ms
[2025-06-01 07:51:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 16 ms.
[2025-06-01 07:51:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality11742502553219787314.gal : 5 ms
[2025-06-01 07:51:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality4712359259963141118.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11742502553219787314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4712359259963141118.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.73257e+06,22.6049,441268,2,74389,5,1.02788e+06,6,0,611,1.54088e+06,0
Converting to forward existential form...Done !
original formula: (EX(TRUE) + EF((EX(TRUE) * EF(((gu1.SUR_PONT_B>gu1.ROUTE_B)&&(gi1.gu0.ATTENTE_A<43))))))
=> equivalent forward existential formula: ([(EY(Init) * TRUE)] != FALSE + [(FwdU((FwdU(Init,TRUE) * EX(TRUE)),TRUE) * ((gu1.SUR_PONT_B>gu1.ROUTE_B)&&(gi1....185
(forward)formula 0,1,22.6202,441268,1,0,6,1.02788e+06,7,1,766,1.54088e+06,1
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 506
Applied a total of 1 rules in 8 ms. Remains 67 /68 variables (removed 1) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2025-06-01 07:52:14] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 67 cols
[2025-06-01 07:52:14] [INFO ] Computed 8 invariants in 2 ms
[2025-06-01 07:52:14] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:52:17] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:52:27] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
SMT process timed out in 20561ms, After SMT, problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 20565ms
[2025-06-01 07:52:35] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2025-06-01 07:52:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 07:52:35] [INFO ] Implicit Places using invariants in 278 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 281 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 506/506 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20862 ms. Remains : 65/68 places, 506/506 transitions.
[2025-06-01 07:52:35] [INFO ] Flatten gal took : 32 ms
[2025-06-01 07:52:35] [INFO ] Flatten gal took : 36 ms
[2025-06-01 07:52:35] [INFO ] Input system was already deterministic with 506 transitions.
[2025-06-01 07:52:35] [INFO ] Flatten gal took : 35 ms
[2025-06-01 07:52:35] [INFO ] Flatten gal took : 35 ms
[2025-06-01 07:52:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality12119601789380231321.gal : 5 ms
[2025-06-01 07:52:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality17688736049364730155.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12119601789380231321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17688736049364730155.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 07:53:05] [INFO ] Flatten gal took : 24 ms
[2025-06-01 07:53:05] [INFO ] Applying decomposition
[2025-06-01 07:53:05] [INFO ] Flatten gal took : 23 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/graph17100249550308662113.txt' '-o' '/tmp/graph17100249550308662113.bin' '-w' '/tmp/graph17100249550308662113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17100249550308662113.bin' '-l' '-1' '-v' '-w' '/tmp/graph17100249550308662113.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:53:05] [INFO ] Decomposing Gal with order
[2025-06-01 07:53:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:53:06] [INFO ] Removed a total of 893 redundant transitions.
[2025-06-01 07:53:06] [INFO ] Flatten gal took : 217 ms
[2025-06-01 07:53:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 614 labels/synchronizations in 26 ms.
[2025-06-01 07:53:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality4343336816426655074.gal : 3 ms
[2025-06-01 07:53:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality10514208363649676017.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4343336816426655074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10514208363649676017.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.73257e+06,8.63616,193612,2,79509,5,704163,6,0,610,642899,0
Converting to forward existential form...Done !
original formula: EX(EF(EX(((((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1)>69)||(gu1.SORTI_B>gu1.ROUTE_B))||(gi2.gu0.SUR_PONT_A>17)))))
=> equivalent forward existential formula: [(EY(FwdU(EY(Init),TRUE)) * ((((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1)>69)||(gu1.SORTI_B>gu1.ROUTE_B))||(gi2.gu0.SUR...178
(forward)formula 0,1,15.3345,239564,1,0,10,892776,9,1,1064,915191,5
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Graph (complete) has 1139 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 505
Applied a total of 3 rules in 47 ms. Remains 66 /68 variables (removed 2) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2025-06-01 07:53:21] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 66 cols
[2025-06-01 07:53:21] [INFO ] Computed 8 invariants in 2 ms
[2025-06-01 07:53:21] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:53:24] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:53:34] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/191 variables, 66/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 191/191 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/191 variables, 66/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40717ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 40719ms
[2025-06-01 07:54:02] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-06-01 07:54:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 07:54:02] [INFO ] Implicit Places using invariants in 239 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 242 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 64/68 places, 505/506 transitions.
Applied a total of 0 rules in 37 ms. Remains 64 /64 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41047 ms. Remains : 64/68 places, 505/506 transitions.
[2025-06-01 07:54:02] [INFO ] Flatten gal took : 29 ms
[2025-06-01 07:54:02] [INFO ] Flatten gal took : 33 ms
[2025-06-01 07:54:02] [INFO ] Input system was already deterministic with 505 transitions.
[2025-06-01 07:54:03] [INFO ] Flatten gal took : 29 ms
[2025-06-01 07:54:03] [INFO ] Flatten gal took : 31 ms
[2025-06-01 07:54:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality382359169272189612.gal : 8 ms
[2025-06-01 07:54:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17437246712401190585.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality382359169272189612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17437246712401190585.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 07:54:33] [INFO ] Flatten gal took : 32 ms
[2025-06-01 07:54:33] [INFO ] Applying decomposition
[2025-06-01 07:54:33] [INFO ] Flatten gal took : 33 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/graph12080983172873517280.txt' '-o' '/tmp/graph12080983172873517280.bin' '-w' '/tmp/graph12080983172873517280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12080983172873517280.bin' '-l' '-1' '-v' '-w' '/tmp/graph12080983172873517280.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:54:33] [INFO ] Decomposing Gal with order
[2025-06-01 07:54:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:54:33] [INFO ] Removed a total of 1073 redundant transitions.
[2025-06-01 07:54:33] [INFO ] Flatten gal took : 142 ms
[2025-06-01 07:54:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 155 labels/synchronizations in 16 ms.
[2025-06-01 07:54:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality16756098443313822351.gal : 4 ms
[2025-06-01 07:54:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality12161778792184150512.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16756098443313822351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12161778792184150512.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.05339e+06,16.2967,342084,4113,4450,351451,93420,119,2.201e+06,222,1.45858e+06,0
Converting to forward existential form...Done !
original formula: AF(AG((i1.u2.SORTI_B<1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((i1.u2.SORTI_B<1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t40, t41, t43, t83, t84, t184, t284, t383, t483, t485, t501, i1.u2.t42, Intersection wit...236
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 505
Applied a total of 4 rules in 19 ms. Remains 65 /68 variables (removed 3) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2025-06-01 07:55:03] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2025-06-01 07:55:03] [INFO ] Computed 7 invariants in 2 ms
[2025-06-01 07:55:03] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:55:06] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:55:16] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/190 variables, and 94 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 502/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 596 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40845ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 40848ms
[2025-06-01 07:55:44] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-06-01 07:55:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 07:55:44] [INFO ] Implicit Places using invariants in 189 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 193 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 505/506 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41067 ms. Remains : 63/68 places, 505/506 transitions.
[2025-06-01 07:55:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-01 07:55:44] [INFO ] Flatten gal took : 25 ms
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 07:55:44] [INFO ] Flatten gal took : 26 ms
[2025-06-01 07:55:44] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 505
Applied a total of 4 rules in 11 ms. Remains 65 /68 variables (removed 3) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2025-06-01 07:55:44] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-06-01 07:55:44] [INFO ] Invariant cache hit.
[2025-06-01 07:55:44] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:55:48] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 93 constraints, problems are : Problem set: 0 solved, 502 unsolved in 18852 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 502/595 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 595 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39510ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 39513ms
[2025-06-01 07:56:24] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-06-01 07:56:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 07:56:24] [INFO ] Implicit Places using invariants in 268 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 270 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 505/506 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39801 ms. Remains : 63/68 places, 505/506 transitions.
[2025-06-01 07:56:24] [INFO ] Flatten gal took : 14 ms
[2025-06-01 07:56:24] [INFO ] Flatten gal took : 16 ms
[2025-06-01 07:56:24] [INFO ] Input system was already deterministic with 505 transitions.
[2025-06-01 07:56:24] [INFO ] Flatten gal took : 16 ms
[2025-06-01 07:56:24] [INFO ] Flatten gal took : 15 ms
[2025-06-01 07:56:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality13119356125134081808.gal : 4 ms
[2025-06-01 07:56:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality10805819290704308499.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13119356125134081808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10805819290704308499.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 07:56:54] [INFO ] Flatten gal took : 17 ms
[2025-06-01 07:56:54] [INFO ] Applying decomposition
[2025-06-01 07:56:54] [INFO ] Flatten gal took : 30 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/graph13935687976773135493.txt' '-o' '/tmp/graph13935687976773135493.bin' '-w' '/tmp/graph13935687976773135493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13935687976773135493.bin' '-l' '-1' '-v' '-w' '/tmp/graph13935687976773135493.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:56:54] [INFO ] Decomposing Gal with order
[2025-06-01 07:56:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:56:55] [INFO ] Removed a total of 874 redundant transitions.
[2025-06-01 07:56:55] [INFO ] Flatten gal took : 80 ms
[2025-06-01 07:56:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 6 ms.
[2025-06-01 07:56:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality13844380766817996398.gal : 1 ms
[2025-06-01 07:56:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality1990997496887071322.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13844380766817996398.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1990997496887071322.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.73257e+06,23.301,431476,890,4893,125718,205033,100,1.34836e+06,207,5.26856e+06,0
Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,23.3348,431476,1,0,125718,205033,140,1.34836e+06,303,5.26856e+06,86
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 505
Applied a total of 4 rules in 6 ms. Remains 65 /68 variables (removed 3) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2025-06-01 07:57:18] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-06-01 07:57:18] [INFO ] Invariant cache hit.
[2025-06-01 07:57:18] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:57:21] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 93 constraints, problems are : Problem set: 0 solved, 502 unsolved in 15919 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 502/595 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 595 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36549ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 36551ms
[2025-06-01 07:57:55] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-06-01 07:57:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 07:57:55] [INFO ] Implicit Places using invariants in 225 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 227 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 505/506 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36790 ms. Remains : 63/68 places, 505/506 transitions.
[2025-06-01 07:57:55] [INFO ] Flatten gal took : 24 ms
[2025-06-01 07:57:55] [INFO ] Flatten gal took : 26 ms
[2025-06-01 07:57:55] [INFO ] Input system was already deterministic with 505 transitions.
[2025-06-01 07:57:55] [INFO ] Flatten gal took : 26 ms
[2025-06-01 07:57:55] [INFO ] Flatten gal took : 26 ms
[2025-06-01 07:57:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality4966638400023543389.gal : 9 ms
[2025-06-01 07:57:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality4006250378357471658.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4966638400023543389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4006250378357471658.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 07:58:25] [INFO ] Flatten gal took : 15 ms
[2025-06-01 07:58:25] [INFO ] Applying decomposition
[2025-06-01 07:58:25] [INFO ] Flatten gal took : 15 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/graph3839889341396886358.txt' '-o' '/tmp/graph3839889341396886358.bin' '-w' '/tmp/graph3839889341396886358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3839889341396886358.bin' '-l' '-1' '-v' '-w' '/tmp/graph3839889341396886358.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:58:25] [INFO ] Decomposing Gal with order
[2025-06-01 07:58:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:58:25] [INFO ] Removed a total of 400 redundant transitions.
[2025-06-01 07:58:25] [INFO ] Flatten gal took : 232 ms
[2025-06-01 07:58:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 402 labels/synchronizations in 7 ms.
[2025-06-01 07:58:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality7664453678549794213.gal : 4 ms
[2025-06-01 07:58:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality5448574804951230002.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7664453678549794213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5448574804951230002.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 506
Applied a total of 2 rules in 5 ms. Remains 66 /68 variables (removed 2) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2025-06-01 07:58:55] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2025-06-01 07:58:55] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 07:58:55] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 07:58:58] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 126/192 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 94 constraints, problems are : Problem set: 0 solved, 503 unsolved in 17641 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 126/192 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 503/597 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 597 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38212ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 38215ms
[2025-06-01 07:59:34] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2025-06-01 07:59:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 07:59:34] [INFO ] Implicit Places using invariants in 292 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 294 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 506/506 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38522 ms. Remains : 65/68 places, 506/506 transitions.
[2025-06-01 07:59:34] [INFO ] Flatten gal took : 20 ms
[2025-06-01 07:59:34] [INFO ] Flatten gal took : 24 ms
[2025-06-01 07:59:34] [INFO ] Input system was already deterministic with 506 transitions.
[2025-06-01 07:59:34] [INFO ] Flatten gal took : 24 ms
[2025-06-01 07:59:34] [INFO ] Flatten gal took : 24 ms
[2025-06-01 07:59:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality8485841877848956295.gal : 6 ms
[2025-06-01 07:59:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality3635548396425599390.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8485841877848956295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3635548396425599390.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 08:00:04] [INFO ] Flatten gal took : 16 ms
[2025-06-01 08:00:04] [INFO ] Applying decomposition
[2025-06-01 08:00:04] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph674070382604552295.txt' '-o' '/tmp/graph674070382604552295.bin' '-w' '/tmp/graph674070382604552295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph674070382604552295.bin' '-l' '-1' '-v' '-w' '/tmp/graph674070382604552295.weights' '-q' '0' '-e' '0.001'
[2025-06-01 08:00:04] [INFO ] Decomposing Gal with order
[2025-06-01 08:00:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 08:00:04] [INFO ] Removed a total of 864 redundant transitions.
[2025-06-01 08:00:04] [INFO ] Flatten gal took : 70 ms
[2025-06-01 08:00:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 164 labels/synchronizations in 6 ms.
[2025-06-01 08:00:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality1161771993066294942.gal : 1 ms
[2025-06-01 08:00:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality16480437269144670730.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1161771993066294942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16480437269144670730.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.73257e+06,8.99262,204748,2,86797,5,700715,6,0,442,762592,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 505
Applied a total of 4 rules in 6 ms. Remains 65 /68 variables (removed 3) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2025-06-01 08:00:34] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2025-06-01 08:00:34] [INFO ] Computed 7 invariants in 2 ms
[2025-06-01 08:00:34] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:00:38] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:00:49] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/190 variables, and 94 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 502/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 596 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40596ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 40601ms
[2025-06-01 08:01:15] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-06-01 08:01:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 08:01:15] [INFO ] Implicit Places using invariants in 309 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 311 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 505/506 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40924 ms. Remains : 64/68 places, 505/506 transitions.
[2025-06-01 08:01:15] [INFO ] Flatten gal took : 20 ms
[2025-06-01 08:01:15] [INFO ] Flatten gal took : 24 ms
[2025-06-01 08:01:15] [INFO ] Input system was already deterministic with 505 transitions.
[2025-06-01 08:01:15] [INFO ] Flatten gal took : 23 ms
[2025-06-01 08:01:16] [INFO ] Flatten gal took : 24 ms
[2025-06-01 08:01:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality16596117328940613516.gal : 5 ms
[2025-06-01 08:01:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality5258474933991794866.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16596117328940613516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5258474933991794866.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 08:01:46] [INFO ] Flatten gal took : 15 ms
[2025-06-01 08:01:46] [INFO ] Applying decomposition
[2025-06-01 08:01:46] [INFO ] Flatten gal took : 15 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/graph14850990290405601172.txt' '-o' '/tmp/graph14850990290405601172.bin' '-w' '/tmp/graph14850990290405601172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14850990290405601172.bin' '-l' '-1' '-v' '-w' '/tmp/graph14850990290405601172.weights' '-q' '0' '-e' '0.001'
[2025-06-01 08:01:46] [INFO ] Decomposing Gal with order
[2025-06-01 08:01:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 08:01:46] [INFO ] Removed a total of 1162 redundant transitions.
[2025-06-01 08:01:46] [INFO ] Flatten gal took : 70 ms
[2025-06-01 08:01:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 30 ms.
[2025-06-01 08:01:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality6739619276504945615.gal : 3 ms
[2025-06-01 08:01:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality18171825279151338168.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6739619276504945615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18171825279151338168.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.73257e+06,27.3535,433768,2799,3792,750283,192749,224,1.4675e+06,187,1.3281e+06,0
Converting to forward existential form...Done !
original formula: AX(AF(AX(AF(EG((i0.u3.ATTENTE_B>=5))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(EX(!(!(EG(!(EG((i0.u3.ATTENTE_B>=5))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t41, t42, t43, t83, t84, t202, t282, t389, t404, t469, t484, i0.u1.t20, i2.t284, i2.t224,...254
Detected timeout of ITS tools.
[2025-06-01 08:02:16] [INFO ] Flatten gal took : 35 ms
[2025-06-01 08:02:16] [INFO ] Flatten gal took : 26 ms
[2025-06-01 08:02:16] [INFO ] Applying decomposition
[2025-06-01 08:02:16] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2652532290609028270.txt' '-o' '/tmp/graph2652532290609028270.bin' '-w' '/tmp/graph2652532290609028270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2652532290609028270.bin' '-l' '-1' '-v' '-w' '/tmp/graph2652532290609028270.weights' '-q' '0' '-e' '0.001'
[2025-06-01 08:02:16] [INFO ] Decomposing Gal with order
[2025-06-01 08:02:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 08:02:16] [INFO ] Removed a total of 438 redundant transitions.
[2025-06-01 08:02:16] [INFO ] Flatten gal took : 286 ms
[2025-06-01 08:02:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 442 labels/synchronizations in 8 ms.
[2025-06-01 08:02:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality13224834592365279911.gal : 3 ms
[2025-06-01 08:02:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality965522238241430238.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13224834592365279911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality965522238241430238.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 08:26:54] [INFO ] Applying decomposition
[2025-06-01 08:26:54] [INFO ] Flatten gal took : 18 ms
[2025-06-01 08:26:54] [INFO ] Decomposing Gal with order
[2025-06-01 08:26:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 08:26:54] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to CAPACITE in partition [CONTROLEUR_0, CHOIX_0, VIDANGE_0],[CONTROLEUR_1, CHOIX_1, VIDANGE_1],[COMPTEUR_0],[COMPTEUR_1],[COMPTEUR_2],[COMPTEUR_3],[COMPTEUR_4],[COMPTEUR_5],[COMPTEUR_6],[COMPTEUR_7],[COMPTEUR_8],[COMPTEUR_9],[COMPTEUR_10],[NB_ATTENTE_A_0],[NB_ATTENTE_A_1],[NB_ATTENTE_A_2],[NB_ATTENTE_A_3],[NB_ATTENTE_A_4],[NB_ATTENTE_A_5],[NB_ATTENTE_A_6],[NB_ATTENTE_A_7],[NB_ATTENTE_A_8],[NB_ATTENTE_A_9],[NB_ATTENTE_A_10],[NB_ATTENTE_A_11],[NB_ATTENTE_A_12],[NB_ATTENTE_A_13],[NB_ATTENTE_A_14],[NB_ATTENTE_A_15],[NB_ATTENTE_A_16],[NB_ATTENTE_A_17],[NB_ATTENTE_A_18],[NB_ATTENTE_A_19],[NB_ATTENTE_A_20],[NB_ATTENTE_B_0],[NB_ATTENTE_B_1],[NB_ATTENTE_B_2],[NB_ATTENTE_B_3],[NB_ATTENTE_B_4],[NB_ATTENTE_B_5],[NB_ATTENTE_B_6],[NB_ATTENTE_B_7],[NB_ATTENTE_B_8],[NB_ATTENTE_B_9],[NB_ATTENTE_B_10],[NB_ATTENTE_B_11],[NB_ATTENTE_B_12],[NB_ATTENTE_B_13],[NB_ATTENTE_B_14],[NB_ATTENTE_B_15],[NB_ATTENTE_B_16],[NB_ATTENTE_B_17],[NB_ATTENTE_B_18],[NB_ATTENTE_B_19],[NB_ATTENTE_B_20],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-01 08:26:54] [INFO ] Flatten gal took : 15 ms
[2025-06-01 08:26:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality8270433939724293551.gal : 4 ms
[2025-06-01 08:26:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality5882350906680164982.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8270433939724293551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5882350906680164982.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.73257e+06,1259.7,6993696,2,2.02301e+06,5,4.03871e+06,6,0,774,7.21836e+06,0
Converting to forward existential form...Done !
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="BridgeAndVehicles-COL-V20P20N10"
export BK_EXAMINATION="CTLCardinality"
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 BridgeAndVehicles-COL-V20P20N10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-smll-174853764600201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N10.tgz
mv BridgeAndVehicles-COL-V20P20N10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;