fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r027-smll-174853774200032
Last Updated
June 24, 2025

About the Execution of 2024-gold for BridgeAndVehicles-COL-V50P50N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15694.580 1457297.00 2015837.00 4750.60 50 50 1 50 10 1 10 50 50 1 1 1 1 1 1 50 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r027-smll-174853774200032.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 gold2024
Input is BridgeAndVehicles-COL-V50P50N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774200032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 42K 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 positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748545222478

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-05-29 19:00:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 19:00:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:00:25] [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-05-29 19:00:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-29 19:00:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1163 ms
[2025-05-29 19:00:26] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 45 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 10
[2025-05-29 19:00:26] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 7 ms.
[2025-05-29 19:00:26] [INFO ] Skeletonized 10 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2025-05-29 19:00:26] [INFO ] Computed 4 invariants in 7 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[50, 0, 1, 0, 0, 0, 0, 0, 1, 1] Max Struct:[50, 50, 1, 50, 1, 50, 50, 50, 1, 1]
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-05-29 19:00:26] [INFO ] Invariant cache hit.
[2025-05-29 19:00:26] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2025-05-29 19:00:26] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-05-29 19:00:27] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-29 19:00:27] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Minimization took 23 ms.
[2025-05-29 19:00:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-29 19:00:27] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-05-29 19:00:27] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-29 19:00:27] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 19:00:27] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 19:00:27] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-05-29 19:00:27] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-29 19:00:27] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2025-05-29 19:00:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:00:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-29 19:00:27] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-05-29 19:00:27] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-29 19:00:27] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 19:00:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-29 19:00:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-05-29 19:00:27] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 6 ms.
[2025-05-29 19:00:27] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 5 ms.
[2025-05-29 19:00:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-29 19:00:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-05-29 19:00:27] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 6 ms.
[2025-05-29 19:00:27] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 19:00:27] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-29 19:00:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-05-29 19:00:27] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-29 19:00:27] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 1, 50, 50, 50]
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] 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-05-29 19:00:27] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 201 ms.
[2025-05-29 19:00:27] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 1, 50, 50, 50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 1, 50, 50, 50]
[2025-05-29 19:00:27] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2025-05-29 19:00:27] [INFO ] Computed 7 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 1, 50, 50, 50]
RANDOM walk for 10000 steps (22 resets) in 282 ms. (35 steps per ms)
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20006 steps (17 resets) in 259 ms. (76 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 5] Max Struct:[50, 50]
[2025-05-29 19:00:28] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2025-05-29 19:00:28] [INFO ] Invariant cache hit.
[2025-05-29 19:00:28] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 19:00:28] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-05-29 19:00:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:00:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 19:00:28] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2025-05-29 19:00:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 19:00:28] [INFO ] [Nat]Added 22 Read/Feed constraints in 32 ms returned sat
[2025-05-29 19:00:29] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 114 ms.
[2025-05-29 19:00:29] [INFO ] Added : 10 causal constraints over 2 iterations in 253 ms. Result :sat
Minimization took 150 ms.
[2025-05-29 19:00:29] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 19:00:29] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2025-05-29 19:00:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:00:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 19:00:29] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2025-05-29 19:00:29] [INFO ] [Nat]Added 22 Read/Feed constraints in 24 ms returned sat
[2025-05-29 19:00:30] [INFO ] Deduced a trap composed of 6 places in 353 ms of which 37 ms to minimize.
[2025-05-29 19:00:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2025-05-29 19:00:30] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 73 ms.
[2025-05-29 19:00:30] [INFO ] Deduced a trap composed of 14 places in 446 ms of which 4 ms to minimize.
[2025-05-29 19:00:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 524 ms
[2025-05-29 19:00:31] [INFO ] Added : 12 causal constraints over 10 iterations in 963 ms. Result :sat
Minimization took 227 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 5] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 222 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2025-05-29 19:00:32] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2025-05-29 19:00:32] [INFO ] Computed 5 invariants in 5 ms
[2025-05-29 19:00:32] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2025-05-29 19:00:49] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 6 constraints, problems are : Problem set: 0 solved, 1325 unsolved in 20116 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1325 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2025-05-29 19:01:15] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 2 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 49)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/376 variables, and 7 constraints, problems are : Problem set: 50 solved, 1275 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/1325 constraints, Known Traps: 2/2 constraints]
After SMT, in 48000ms problems are : Problem set: 50 solved, 1275 unsolved
Search for dead transitions found 50 dead transitions in 48072ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 50 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/128 places, 1278/1328 transitions.
Applied a total of 0 rules in 147 ms. Remains 126 /126 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48484 ms. Remains : 126/128 places, 1278/1328 transitions.
[2025-05-29 19:01:20] [INFO ] Flow matrix only has 249 transitions (discarded 1029 similar events)
// Phase 1: matrix 249 rows 126 cols
[2025-05-29 19:01:20] [INFO ] Computed 5 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2272 resets) in 7811 ms. (128 steps per ms)
BEST_FIRST walk for 2000001 steps (1680 resets) in 5221 ms. (382 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2025-05-29 19:01:33] [INFO ] Flow matrix only has 249 transitions (discarded 1029 similar events)
[2025-05-29 19:01:33] [INFO ] Invariant cache hit.
[2025-05-29 19:01:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:01:33] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-05-29 19:01:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 19:01:33] [INFO ] [Real]Added 21 Read/Feed constraints in 14 ms returned sat
[2025-05-29 19:01:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:01:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:01:33] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-05-29 19:01:33] [INFO ] [Nat]Added 21 Read/Feed constraints in 34 ms returned sat
[2025-05-29 19:01:34] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 68 ms.
[2025-05-29 19:01:34] [INFO ] Added : 10 causal constraints over 2 iterations in 234 ms. Result :sat
Minimization took 213 ms.
[2025-05-29 19:01:34] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:01:34] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-05-29 19:01:34] [INFO ] [Real]Added 21 Read/Feed constraints in 73 ms returned sat
[2025-05-29 19:01:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:01:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-05-29 19:01:34] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-05-29 19:01:35] [INFO ] [Nat]Added 21 Read/Feed constraints in 38 ms returned sat
[2025-05-29 19:01:35] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 41 ms.
[2025-05-29 19:01:35] [INFO ] Added : 12 causal constraints over 10 iterations in 237 ms. Result :sat
Minimization took 229 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1278/1278 transitions.
Applied a total of 0 rules in 82 ms. Remains 126 /126 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 126/126 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1278/1278 transitions.
Applied a total of 0 rules in 75 ms. Remains 126 /126 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2025-05-29 19:01:36] [INFO ] Flow matrix only has 249 transitions (discarded 1029 similar events)
[2025-05-29 19:01:36] [INFO ] Invariant cache hit.
[2025-05-29 19:01:36] [INFO ] Implicit Places using invariants in 413 ms returned []
[2025-05-29 19:01:36] [INFO ] Flow matrix only has 249 transitions (discarded 1029 similar events)
[2025-05-29 19:01:36] [INFO ] Invariant cache hit.
[2025-05-29 19:01:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 19:01:37] [INFO ] Implicit Places using invariants and state equation in 1312 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1733 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/126 places, 1278/1278 transitions.
Applied a total of 0 rules in 66 ms. Remains 124 /124 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1875 ms. Remains : 124/126 places, 1278/1278 transitions.
[2025-05-29 19:01:38] [INFO ] Flow matrix only has 249 transitions (discarded 1029 similar events)
// Phase 1: matrix 249 rows 124 cols
[2025-05-29 19:01:38] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000002 steps (2272 resets) in 6353 ms. (157 steps per ms)
BEST_FIRST walk for 2000001 steps (1679 resets) in 4691 ms. (426 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2025-05-29 19:01:49] [INFO ] Flow matrix only has 249 transitions (discarded 1029 similar events)
[2025-05-29 19:01:49] [INFO ] Invariant cache hit.
[2025-05-29 19:01:49] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-05-29 19:01:49] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-05-29 19:01:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 19:01:49] [INFO ] [Real]Added 21 Read/Feed constraints in 17 ms returned sat
[2025-05-29 19:01:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:01:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:01:49] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-05-29 19:01:49] [INFO ] [Nat]Added 21 Read/Feed constraints in 23 ms returned sat
[2025-05-29 19:01:49] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 47 ms.
[2025-05-29 19:01:49] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 1 ms to minimize.
[2025-05-29 19:01:50] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 2 ms to minimize.
[2025-05-29 19:01:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 530 ms
[2025-05-29 19:01:50] [INFO ] Added : 10 causal constraints over 2 iterations in 751 ms. Result :sat
Minimization took 176 ms.
[2025-05-29 19:01:50] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:01:50] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-05-29 19:01:50] [INFO ] [Real]Added 21 Read/Feed constraints in 25 ms returned sat
[2025-05-29 19:01:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:01:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-05-29 19:01:50] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-05-29 19:01:50] [INFO ] [Nat]Added 21 Read/Feed constraints in 38 ms returned sat
[2025-05-29 19:01:51] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 2 ms to minimize.
[2025-05-29 19:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2025-05-29 19:01:51] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 58 ms.
[2025-05-29 19:01:51] [INFO ] Added : 12 causal constraints over 10 iterations in 352 ms. Result :sat
Minimization took 225 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1278/1278 transitions.
Applied a total of 0 rules in 104 ms. Remains 124 /124 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 124/124 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1278/1278 transitions.
Applied a total of 0 rules in 97 ms. Remains 124 /124 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2025-05-29 19:01:52] [INFO ] Flow matrix only has 249 transitions (discarded 1029 similar events)
[2025-05-29 19:01:52] [INFO ] Invariant cache hit.
[2025-05-29 19:01:53] [INFO ] Implicit Places using invariants in 488 ms returned []
[2025-05-29 19:01:53] [INFO ] Flow matrix only has 249 transitions (discarded 1029 similar events)
[2025-05-29 19:01:53] [INFO ] Invariant cache hit.
[2025-05-29 19:01:53] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 19:01:54] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
[2025-05-29 19:01:54] [INFO ] Redundant transitions in 129 ms returned []
Running 1275 sub problems to find dead transitions.
[2025-05-29 19:01:54] [INFO ] Flow matrix only has 249 transitions (discarded 1029 similar events)
[2025-05-29 19:01:54] [INFO ] Invariant cache hit.
[2025-05-29 19:01:54] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
[2025-05-29 19:02:09] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/373 variables, and 6 constraints, problems are : Problem set: 0 solved, 1275 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 1275/1275 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 249/373 variables, 124/130 constraints. Problems are: Problem set: 2 solved, 1273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 21/151 constraints. Problems are: Problem set: 2 solved, 1273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 1424 constraints, problems are : Problem set: 2 solved, 1273 unsolved in 31961 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1273/1275 constraints, Known Traps: 1/1 constraints]
After SMT, in 68176ms problems are : Problem set: 2 solved, 1273 unsolved
Search for dead transitions found 2 dead transitions in 68203ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/124 places, 1276/1278 transitions.
Applied a total of 0 rules in 60 ms. Remains 124 /124 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
[2025-05-29 19:03:03] [INFO ] Redundant transitions in 74 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 70522 ms. Remains : 124/124 places, 1276/1278 transitions.
[2025-05-29 19:03:03] [INFO ] Flow matrix only has 247 transitions (discarded 1029 similar events)
// Phase 1: matrix 247 rows 124 cols
[2025-05-29 19:03:03] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2272 resets) in 6685 ms. (149 steps per ms)
BEST_FIRST walk for 2000001 steps (1683 resets) in 4625 ms. (432 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2025-05-29 19:03:14] [INFO ] Flow matrix only has 247 transitions (discarded 1029 similar events)
[2025-05-29 19:03:14] [INFO ] Invariant cache hit.
[2025-05-29 19:03:14] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:03:14] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-05-29 19:03:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:03:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:03:14] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-05-29 19:03:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 19:03:14] [INFO ] [Nat]Added 21 Read/Feed constraints in 25 ms returned sat
[2025-05-29 19:03:14] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 136 transitions) in 40 ms.
[2025-05-29 19:03:15] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 2 ms to minimize.
[2025-05-29 19:03:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2025-05-29 19:03:15] [INFO ] Added : 11 causal constraints over 3 iterations in 522 ms. Result :sat
Minimization took 167 ms.
[2025-05-29 19:03:15] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:03:15] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2025-05-29 19:03:15] [INFO ] [Real]Added 21 Read/Feed constraints in 30 ms returned sat
[2025-05-29 19:03:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:03:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:03:16] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-05-29 19:03:16] [INFO ] [Nat]Added 21 Read/Feed constraints in 24 ms returned sat
[2025-05-29 19:03:16] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 1 ms to minimize.
[2025-05-29 19:03:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2025-05-29 19:03:16] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 136 transitions) in 35 ms.
[2025-05-29 19:03:16] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 2 ms to minimize.
[2025-05-29 19:03:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2025-05-29 19:03:16] [INFO ] Added : 7 causal constraints over 6 iterations in 578 ms. Result :sat
Minimization took 366 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1276/1276 transitions.
Applied a total of 0 rules in 89 ms. Remains 124 /124 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 124/124 places, 1276/1276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1276/1276 transitions.
Applied a total of 0 rules in 87 ms. Remains 124 /124 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
[2025-05-29 19:03:17] [INFO ] Flow matrix only has 247 transitions (discarded 1029 similar events)
[2025-05-29 19:03:17] [INFO ] Invariant cache hit.
[2025-05-29 19:03:18] [INFO ] Implicit Places using invariants in 437 ms returned []
[2025-05-29 19:03:18] [INFO ] Flow matrix only has 247 transitions (discarded 1029 similar events)
[2025-05-29 19:03:18] [INFO ] Invariant cache hit.
[2025-05-29 19:03:18] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 19:03:19] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
[2025-05-29 19:03:19] [INFO ] Redundant transitions in 52 ms returned []
Running 1273 sub problems to find dead transitions.
[2025-05-29 19:03:19] [INFO ] Flow matrix only has 247 transitions (discarded 1029 similar events)
[2025-05-29 19:03:19] [INFO ] Invariant cache hit.
[2025-05-29 19:03:19] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1273 unsolved
[2025-05-29 19:03:35] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 2 ms to minimize.
[2025-05-29 19:03:37] [INFO ] Deduced a trap composed of 14 places in 293 ms of which 2 ms to minimize.
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/371 variables, and 7 constraints, problems are : Problem set: 50 solved, 1223 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 1273/1273 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 50 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 50 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 50 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 247/371 variables, 124/131 constraints. Problems are: Problem set: 50 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 21/152 constraints. Problems are: Problem set: 50 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 1375 constraints, problems are : Problem set: 50 solved, 1223 unsolved in 31870 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1223/1273 constraints, Known Traps: 2/2 constraints]
After SMT, in 68800ms problems are : Problem set: 50 solved, 1223 unsolved
Search for dead transitions found 50 dead transitions in 68826ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/124 places, 1226/1276 transitions.
Applied a total of 0 rules in 53 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2025-05-29 19:04:28] [INFO ] Redundant transitions in 18 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 70298 ms. Remains : 124/124 places, 1226/1276 transitions.
[2025-05-29 19:04:28] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2025-05-29 19:04:28] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2273 resets) in 6380 ms. (156 steps per ms)
BEST_FIRST walk for 2000002 steps (1679 resets) in 4851 ms. (412 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2025-05-29 19:04:39] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:04:39] [INFO ] Invariant cache hit.
[2025-05-29 19:04:39] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:04:39] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-05-29 19:04:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:04:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:04:39] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-05-29 19:04:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:04:39] [INFO ] [Nat]Added 20 Read/Feed constraints in 23 ms returned sat
[2025-05-29 19:04:39] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 35 ms.
[2025-05-29 19:04:40] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 3 ms to minimize.
[2025-05-29 19:04:40] [INFO ] Deduced a trap composed of 14 places in 280 ms of which 4 ms to minimize.
[2025-05-29 19:04:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 615 ms
[2025-05-29 19:04:40] [INFO ] Added : 10 causal constraints over 2 iterations in 819 ms. Result :sat
Minimization took 108 ms.
[2025-05-29 19:04:40] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:04:40] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-05-29 19:04:40] [INFO ] [Real]Added 20 Read/Feed constraints in 13 ms returned sat
[2025-05-29 19:04:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:04:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:04:40] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-05-29 19:04:40] [INFO ] [Nat]Added 20 Read/Feed constraints in 19 ms returned sat
[2025-05-29 19:04:40] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 36 ms.
[2025-05-29 19:04:41] [INFO ] Added : 12 causal constraints over 10 iterations in 203 ms. Result :sat
Minimization took 200 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 54 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 124/124 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 54 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2025-05-29 19:04:41] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:04:41] [INFO ] Invariant cache hit.
[2025-05-29 19:04:42] [INFO ] Implicit Places using invariants in 311 ms returned []
[2025-05-29 19:04:42] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:04:42] [INFO ] Invariant cache hit.
[2025-05-29 19:04:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:04:42] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2025-05-29 19:04:42] [INFO ] Redundant transitions in 18 ms returned []
Running 1223 sub problems to find dead transitions.
[2025-05-29 19:04:42] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:04:42] [INFO ] Invariant cache hit.
[2025-05-29 19:04:42] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2025-05-29 19:04:57] [INFO ] Deduced a trap composed of 5 places in 316 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 31434 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 66876ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 66891ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67857 ms. Remains : 124/124 places, 1226/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 1490 ms. (26 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 552 ms. (72 steps per ms) remains 4/4 properties
[2025-05-29 19:05:50] [INFO ] Flatten gal took : 545 ms
BEST_FIRST walk for 40001 steps (32 resets) in 527 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 346 ms. (115 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
[2025-05-29 19:05:50] [INFO ] Flatten gal took : 316 ms
[2025-05-29 19:05:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6633018235800616634.gal : 94 ms
[2025-05-29 19:05:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17581219819784253754.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6633018235800616634.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17581219819784253754.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17581219819784253754.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :32 after 67
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :67 after 168
Interrupted probabilistic random walk after 174693 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 4
Probabilistic random walk after 174693 steps, saw 48276 distinct states, run finished after 3013 ms. (steps per millisecond=57 ) properties seen :0
[2025-05-29 19:05:53] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:05:53] [INFO ] Invariant cache hit.
[2025-05-29 19:05:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/357 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-05-29 19:05:54] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :168 after 562
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-05-29 19:05:54] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 2 ms to minimize.
[2025-05-29 19:05:55] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 256
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD size :562 after 859
At refinement iteration 17 (OVERLAPS) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 152 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1722 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/370 variables, 13/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/370 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 156 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1549 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 3312ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2182 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 54 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2025-05-29 19:05:59] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:05:59] [INFO ] Invariant cache hit.
[2025-05-29 19:05:59] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :859 after 3640
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3640 after 16338
[2025-05-29 19:06:11] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 2 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :32724 after 33338
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :33338 after 34996
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Detected timeout of ITS tools.
[2025-05-29 19:06:41] [INFO ] Flatten gal took : 93 ms
[2025-05-29 19:06:41] [INFO ] Applying decomposition
[2025-05-29 19:06:41] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph241092251837485252.txt' '-o' '/tmp/graph241092251837485252.bin' '-w' '/tmp/graph241092251837485252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph241092251837485252.bin' '-l' '-1' '-v' '-w' '/tmp/graph241092251837485252.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:06:41] [INFO ] Decomposing Gal with order
[2025-05-29 19:06:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:06:42] [INFO ] Removed a total of 2134 redundant transitions.
[2025-05-29 19:06:42] [INFO ] Flatten gal took : 686 ms
[2025-05-29 19:06:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 285 labels/synchronizations in 34 ms.
[2025-05-29 19:06:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4973996287637187175.gal : 8 ms
[2025-05-29 19:06:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13321048491498701947.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4973996287637187175.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13321048491498701947.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13321048491498701947.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :22 after 47
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :47 after 92
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :92 after 177
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :177 after 327
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :327 after 702
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :702 after 1458
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1458 after 31263
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :31263 after 75669
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :75669 after 135850
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 21661 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 46962ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 46981ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47042 ms. Remains : 124/124 places, 1226/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 391 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 295 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 283 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :252632 after 436970
Interrupted probabilistic random walk after 162682 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 4
Probabilistic random walk after 162682 steps, saw 45058 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2025-05-29 19:06:49] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:06:49] [INFO ] Invariant cache hit.
[2025-05-29 19:06:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/357 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-05-29 19:06:50] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-05-29 19:06:50] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 3 ms to minimize.
[2025-05-29 19:06:51] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 152 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/370 variables, 13/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/370 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 156 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 3234ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2063 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 54 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 124/124 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 55 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2025-05-29 19:06:55] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:06:55] [INFO ] Invariant cache hit.
[2025-05-29 19:06:55] [INFO ] Implicit Places using invariants in 343 ms returned []
[2025-05-29 19:06:55] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:06:55] [INFO ] Invariant cache hit.
[2025-05-29 19:06:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:06:56] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2025-05-29 19:06:56] [INFO ] Redundant transitions in 19 ms returned []
Running 1223 sub problems to find dead transitions.
[2025-05-29 19:06:56] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:06:56] [INFO ] Invariant cache hit.
[2025-05-29 19:06:56] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :3.03674e+06 after 3.23838e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2025-05-29 19:07:08] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :2.57157e+07 after 3.02841e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 31116 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 66870ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 66887ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67973 ms. Remains : 124/124 places, 1226/1226 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10, 10] Max Struct:[50, 50]
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2025-05-29 19:08:03] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:08:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (22 resets) in 106 ms. (93 steps per ms)
BEST_FIRST walk for 10001 steps (8 resets) in 41 ms. (238 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2025-05-29 19:08:03] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:08:03] [INFO ] Invariant cache hit.
[2025-05-29 19:08:03] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:08:03] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2025-05-29 19:08:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:08:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:08:03] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2025-05-29 19:08:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:08:03] [INFO ] [Nat]Added 20 Read/Feed constraints in 37 ms returned sat
[2025-05-29 19:08:03] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 57 ms.
[2025-05-29 19:08:04] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 2 ms to minimize.
[2025-05-29 19:08:04] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 1 ms to minimize.
[2025-05-29 19:08:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 461 ms
[2025-05-29 19:08:04] [INFO ] Added : 10 causal constraints over 2 iterations in 757 ms. Result :sat
Minimization took 176 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1225
Applied a total of 2 rules in 121 ms. Remains 123 /124 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:08:05] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2025-05-29 19:08:05] [INFO ] Computed 5 invariants in 2 ms
[2025-05-29 19:08:05] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:08:18] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 46052ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46077ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46203 ms. Remains : 123/124 places, 1225/1226 transitions.
[2025-05-29 19:08:51] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:08:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (2622 resets) in 6930 ms. (144 steps per ms)
BEST_FIRST walk for 1000001 steps (1087 resets) in 2608 ms. (383 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2025-05-29 19:09:00] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:09:00] [INFO ] Invariant cache hit.
[2025-05-29 19:09:00] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:09:00] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-05-29 19:09:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:09:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:09:01] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-05-29 19:09:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:09:01] [INFO ] [Nat]Added 20 Read/Feed constraints in 48 ms returned sat
[2025-05-29 19:09:01] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 59 ms.
[2025-05-29 19:09:01] [INFO ] Added : 10 causal constraints over 2 iterations in 198 ms. Result :sat
Minimization took 410 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 58 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 52 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-05-29 19:09:02] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:09:02] [INFO ] Invariant cache hit.
[2025-05-29 19:09:02] [INFO ] Implicit Places using invariants in 314 ms returned []
[2025-05-29 19:09:02] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:09:02] [INFO ] Invariant cache hit.
[2025-05-29 19:09:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:09:03] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
[2025-05-29 19:09:03] [INFO ] Redundant transitions in 21 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:09:03] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:09:03] [INFO ] Invariant cache hit.
[2025-05-29 19:09:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:09:16] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30953 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 66315ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66331ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67367 ms. Remains : 123/123 places, 1225/1225 transitions.
[2025-05-29 19:10:09] [INFO ] Flatten gal took : 97 ms
RANDOM walk for 40000 steps (104 resets) in 488 ms. (81 steps per ms) remains 2/2 properties
[2025-05-29 19:10:09] [INFO ] Flatten gal took : 87 ms
[2025-05-29 19:10:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12337846958969410057.gal : 34 ms
[2025-05-29 19:10:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13552796293990350105.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12337846958969410057.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13552796293990350105.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40003 steps (40 resets) in 346 ms. (115 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (42 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13552796293990350105.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 100
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :100 after 233
Interrupted probabilistic random walk after 220309 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 220309 steps, saw 61066 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2025-05-29 19:10:12] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:10:12] [INFO ] Invariant cache hit.
[2025-05-29 19:10:12] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 566
[2025-05-29 19:10:13] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/266 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 101/367 variables, 51/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/368 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1796ms problems are : Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :566 after 1013
Parikh walk visited 0 properties in 875 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 84 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:10:15] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:10:15] [INFO ] Invariant cache hit.
[2025-05-29 19:10:15] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1013 after 3956
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:10:27] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :32724 after 32735
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :32735 after 33348
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :33348 after 34963
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Detected timeout of ITS tools.
[2025-05-29 19:10:59] [INFO ] Flatten gal took : 40 ms
[2025-05-29 19:10:59] [INFO ] Applying decomposition
[2025-05-29 19:10:59] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph818618518702112713.txt' '-o' '/tmp/graph818618518702112713.bin' '-w' '/tmp/graph818618518702112713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph818618518702112713.bin' '-l' '-1' '-v' '-w' '/tmp/graph818618518702112713.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:11:00] [INFO ] Decomposing Gal with order
[2025-05-29 19:11:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:11:00] [INFO ] Removed a total of 3034 redundant transitions.
[2025-05-29 19:11:00] [INFO ] Flatten gal took : 174 ms
[2025-05-29 19:11:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 412 labels/synchronizations in 28 ms.
[2025-05-29 19:11:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1215912193391058303.gal : 5 ms
[2025-05-29 19:11:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality585445391435094060.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1215912193391058303.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality585445391435094060.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality585445391435094060.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 34
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :34 after 69
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :69 after 114
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :114 after 349
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :349 after 1914
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1914 after 21300
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :21300 after 71435
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :71435 after 158803
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :158803 after 300812
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :300812 after 532546
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21173 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46781ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46804ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46892 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 824 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (41 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (41 resets) in 277 ms. (143 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 251926 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 2
Probabilistic random walk after 251926 steps, saw 69824 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2025-05-29 19:11:06] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:11:06] [INFO ] Invariant cache hit.
[2025-05-29 19:11:06] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
[2025-05-29 19:11:06] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :1.13325e+07 after 1.24269e+07
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/266 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 101/367 variables, 51/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/368 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1610ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 640 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 66 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 53 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-05-29 19:11:08] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:11:08] [INFO ] Invariant cache hit.
[2025-05-29 19:11:08] [INFO ] Implicit Places using invariants in 318 ms returned []
[2025-05-29 19:11:08] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:11:08] [INFO ] Invariant cache hit.
[2025-05-29 19:11:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:11:09] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
[2025-05-29 19:11:09] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:11:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:11:09] [INFO ] Invariant cache hit.
[2025-05-29 19:11:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:11:20] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.42348e+08 after 1.44207e+08
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 31133 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 66915ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66930ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67937 ms. Remains : 123/123 places, 1225/1225 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[50]
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-04 in 253117 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2025-05-29 19:12:16] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2025-05-29 19:12:16] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (22 resets) in 66 ms. (149 steps per ms)
BEST_FIRST walk for 10001 steps (8 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2025-05-29 19:12:16] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-05-29 19:12:16] [INFO ] Invariant cache hit.
[2025-05-29 19:12:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:12:16] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2025-05-29 19:12:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:12:16] [INFO ] [Real]Added 20 Read/Feed constraints in 22 ms returned sat
[2025-05-29 19:12:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:12:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:12:16] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-05-29 19:12:16] [INFO ] [Nat]Added 20 Read/Feed constraints in 31 ms returned sat
[2025-05-29 19:12:16] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 53 ms.
[2025-05-29 19:12:17] [INFO ] Added : 12 causal constraints over 10 iterations in 320 ms. Result :sat
Minimization took 322 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1225
Applied a total of 2 rules in 103 ms. Remains 123 /124 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:12:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2025-05-29 19:12:18] [INFO ] Computed 5 invariants in 3 ms
[2025-05-29 19:12:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:12:31] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45234ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45256ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45363 ms. Remains : 123/124 places, 1225/1226 transitions.
[2025-05-29 19:13:03] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:13:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (2622 resets) in 6600 ms. (151 steps per ms)
BEST_FIRST walk for 1000001 steps (1029 resets) in 2467 ms. (405 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2025-05-29 19:13:12] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:13:12] [INFO ] Invariant cache hit.
[2025-05-29 19:13:12] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:13:12] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-05-29 19:13:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:13:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:13:12] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2025-05-29 19:13:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:13:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 23 ms returned sat
[2025-05-29 19:13:12] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 4 ms to minimize.
[2025-05-29 19:13:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2025-05-29 19:13:12] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 50 ms.
[2025-05-29 19:13:13] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 2 ms to minimize.
[2025-05-29 19:13:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2025-05-29 19:13:13] [INFO ] Added : 3 causal constraints over 2 iterations in 459 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 85 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 91 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-05-29 19:13:13] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:13:13] [INFO ] Invariant cache hit.
[2025-05-29 19:13:14] [INFO ] Implicit Places using invariants in 455 ms returned []
[2025-05-29 19:13:14] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:13:14] [INFO ] Invariant cache hit.
[2025-05-29 19:13:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:13:15] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
[2025-05-29 19:13:15] [INFO ] Redundant transitions in 30 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:13:15] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:13:15] [INFO ] Invariant cache hit.
[2025-05-29 19:13:15] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:13:30] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 31219 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 67502ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 67535ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68987 ms. Remains : 123/123 places, 1225/1225 transitions.
[2025-05-29 19:14:22] [INFO ] Flatten gal took : 45 ms
[2025-05-29 19:14:22] [INFO ] Flatten gal took : 50 ms
[2025-05-29 19:14:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12472870916935679838.gal : 15 ms
[2025-05-29 19:14:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4119290818682313668.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12472870916935679838.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4119290818682313668.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (104 resets) in 672 ms. (59 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality4119290818682313668.prop.
BEST_FIRST walk for 40002 steps (40 resets) in 493 ms. (80 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
BEST_FIRST walk for 40004 steps (40 resets) in 393 ms. (101 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 20
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20 after 42
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :42 after 110
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :110 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 570
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :570 after 2348
Interrupted probabilistic random walk after 225815 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 2
Probabilistic random walk after 225815 steps, saw 65744 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2025-05-29 19:14:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:14:26] [INFO ] Invariant cache hit.
[2025-05-29 19:14:26] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:14:26] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/266 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:14:26] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6324 after 6674
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1598ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 291 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 58 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:14:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:14:28] [INFO ] Invariant cache hit.
[2025-05-29 19:14:28] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6674 after 7356
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7356 after 8792
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:14:40] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :8792 after 9757
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Detected timeout of ITS tools.
[2025-05-29 19:15:12] [INFO ] Flatten gal took : 101 ms
[2025-05-29 19:15:12] [INFO ] Applying decomposition
[2025-05-29 19:15:13] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11515282700360741269.txt' '-o' '/tmp/graph11515282700360741269.bin' '-w' '/tmp/graph11515282700360741269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11515282700360741269.bin' '-l' '-1' '-v' '-w' '/tmp/graph11515282700360741269.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:15:13] [INFO ] Decomposing Gal with order
[2025-05-29 19:15:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:15:13] [INFO ] Removed a total of 3037 redundant transitions.
[2025-05-29 19:15:13] [INFO ] Flatten gal took : 206 ms
[2025-05-29 19:15:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 414 labels/synchronizations in 43 ms.
[2025-05-29 19:15:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10908821784213076117.gal : 12 ms
[2025-05-29 19:15:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16173480764411191966.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10908821784213076117.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16173480764411191966.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16173480764411191966.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 51
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :51 after 51
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :51 after 51
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :51 after 51
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :51 after 51
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :43400 after 60602
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20210 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45977ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45993ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46054 ms. Remains : 123/123 places, 1225/1225 transitions.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :149314 after 170716
RANDOM walk for 40000 steps (104 resets) in 1298 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (40 resets) in 481 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 325 ms. (122 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :656308 after 810019
Interrupted probabilistic random walk after 236987 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 236987 steps, saw 69064 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2025-05-29 19:15:17] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:15:17] [INFO ] Invariant cache hit.
[2025-05-29 19:15:17] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:15:18] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/266 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:15:18] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1646ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 315 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 86 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 92 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-05-29 19:15:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:15:20] [INFO ] Invariant cache hit.
[2025-05-29 19:15:20] [INFO ] Implicit Places using invariants in 376 ms returned []
[2025-05-29 19:15:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:15:20] [INFO ] Invariant cache hit.
[2025-05-29 19:15:20] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7.21214e+06 after 7.35958e+06
[2025-05-29 19:15:21] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2025-05-29 19:15:21] [INFO ] Redundant transitions in 29 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:15:21] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:15:21] [INFO ] Invariant cache hit.
[2025-05-29 19:15:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:15:34] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :6.14684e+07 after 6.24381e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 31074 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 67131ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 67154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68435 ms. Remains : 123/123 places, 1225/1225 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[50]
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-06 in 252112 ms.
[2025-05-29 19:16:28] [INFO ] Flatten gal took : 35 ms
[2025-05-29 19:16:28] [INFO ] Applying decomposition
[2025-05-29 19:16:28] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3537102513336901210.txt' '-o' '/tmp/graph3537102513336901210.bin' '-w' '/tmp/graph3537102513336901210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3537102513336901210.bin' '-l' '-1' '-v' '-w' '/tmp/graph3537102513336901210.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:16:28] [INFO ] Decomposing Gal with order
[2025-05-29 19:16:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:16:28] [INFO ] Removed a total of 2636 redundant transitions.
[2025-05-29 19:16:28] [INFO ] Flatten gal took : 259 ms
[2025-05-29 19:16:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 332 labels/synchronizations in 19 ms.
[2025-05-29 19:16:28] [INFO ] Time to serialize gal into /tmp/UpperBounds501970265018818806.gal : 3 ms
[2025-05-29 19:16:28] [INFO ] Time to serialize properties into /tmp/UpperBounds16648023268510428247.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds501970265018818806.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16648023268510428247.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds16648023268510428247.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.47634e+08,489.065,2785972,2634,22017,558066,2.44041e+06,151,6.31201e+06,470,4.16823e+07,0
Total reachable state count : 347634372

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V50P50N10-UpperBounds-04 :0 <= i1.u0.SUR_PONT_A <= 10
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-04 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V50P50N10-UpperBounds-04,0,490.233,2785972,1,0,558066,2.44041e+06,201,6.31201e+06,542,4.16823e+07,922
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V50P50N10-UpperBounds-06 :0 <= i1.u0.SUR_PONT_B <= 10
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-06 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V50P50N10-UpperBounds-06,0,490.243,2785972,1,0,558066,2.44041e+06,213,6.31201e+06,556,4.16823e+07,1494
Total runtime 1454843 ms.

BK_STOP 1748546679775

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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-V50P50N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is BridgeAndVehicles-COL-V50P50N10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r027-smll-174853774200032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P50N10.tgz
mv BridgeAndVehicles-COL-V50P50N10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;