Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399100261.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BridgeAndVehicles-PT-V50P50N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399100261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Apr 13 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Apr 13 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 209K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 13 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 13 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.0M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716330146564

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 22:22:27] [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]
[2024-05-21 22:22:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:22:28] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-21 22:22:28] [INFO ] Transformed 138 places.
[2024-05-21 22:22:28] [INFO ] Transformed 2348 transitions.
[2024-05-21 22:22:28] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Reduction of identical properties reduced properties to check from 16 to 14
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 50, 50, 0, 0, 0, 50, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 50, 50, 0, 0, 0, 50, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 22:22:28] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 22:22:28] [INFO ] Computed 7 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 50, 50, 0, 0, 0, 50, 0] Max Struct:[50, 50, 50, 50, 2, 50, 50, 1, 1, 1, 50, 1]
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (23 resets) in 226 ms. (44 steps per ms)
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (25 resets) in 83 ms. (357 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 20, 1] Max Struct:[50, 50, 2]
[2024-05-21 22:22:28] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:22:28] [INFO ] Invariant cache hit.
[2024-05-21 22:22:28] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-05-21 22:22:28] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-21 22:22:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:22:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-05-21 22:22:28] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-21 22:22:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:22:28] [INFO ] [Nat]Added 42 Read/Feed constraints in 29 ms returned sat
[2024-05-21 22:22:29] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 98 ms.
[2024-05-21 22:22:29] [INFO ] Added : 20 causal constraints over 4 iterations in 348 ms. Result :sat
Minimization took 214 ms.
[2024-05-21 22:22:29] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 22:22:29] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-21 22:22:29] [INFO ] [Real]Added 42 Read/Feed constraints in 18 ms returned sat
[2024-05-21 22:22:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:22:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 22:22:29] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-21 22:22:29] [INFO ] [Nat]Added 42 Read/Feed constraints in 26 ms returned sat
[2024-05-21 22:22:30] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 57 ms.
[2024-05-21 22:22:30] [INFO ] Added : 22 causal constraints over 20 iterations in 356 ms. Result :sat
Minimization took 207 ms.
[2024-05-21 22:22:30] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[7, 20, 1] Max Struct:[50, 50, 1]
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 20] Max Struct:[50, 50]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 320 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 22:22:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 22:22:31] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 22:22:31] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:22:56] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20113 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:23:26] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 2 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1395 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 8 solved, 2337 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 56310ms problems are : Problem set: 8 solved, 2337 unsolved
Search for dead transitions found 8 dead transitions in 56385ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 136/138 places, 2340/2348 transitions.
Applied a total of 0 rules in 273 ms. Remains 136 /136 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57015 ms. Remains : 136/138 places, 2340/2348 transitions.
[2024-05-21 22:23:28] [INFO ] Flow matrix only has 290 transitions (discarded 2050 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 22:23:28] [INFO ] Computed 5 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 6732 ms. (148 steps per ms)
BEST_FIRST walk for 2000003 steps (1624 resets) in 4414 ms. (453 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 22:23:39] [INFO ] Flow matrix only has 290 transitions (discarded 2050 similar events)
[2024-05-21 22:23:39] [INFO ] Invariant cache hit.
[2024-05-21 22:23:39] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 22:23:39] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-21 22:23:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:23:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:23:39] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-21 22:23:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:23:39] [INFO ] [Nat]Added 42 Read/Feed constraints in 35 ms returned sat
[2024-05-21 22:23:40] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 3 ms to minimize.
[2024-05-21 22:23:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2024-05-21 22:23:40] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 78 ms.
[2024-05-21 22:23:40] [INFO ] Added : 21 causal constraints over 5 iterations in 339 ms. Result :sat
Minimization took 243 ms.
[2024-05-21 22:23:40] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:23:40] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-21 22:23:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:23:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:23:40] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-21 22:23:40] [INFO ] [Nat]Added 42 Read/Feed constraints in 27 ms returned sat
[2024-05-21 22:23:41] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 2 ms to minimize.
[2024-05-21 22:23:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2024-05-21 22:23:41] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 81 ms.
[2024-05-21 22:23:41] [INFO ] Added : 22 causal constraints over 20 iterations in 520 ms. Result :sat
Minimization took 213 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2340/2340 transitions.
Applied a total of 0 rules in 192 ms. Remains 136 /136 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 136/136 places, 2340/2340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2340/2340 transitions.
Applied a total of 0 rules in 181 ms. Remains 136 /136 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
[2024-05-21 22:23:43] [INFO ] Flow matrix only has 290 transitions (discarded 2050 similar events)
[2024-05-21 22:23:43] [INFO ] Invariant cache hit.
[2024-05-21 22:23:44] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-21 22:23:44] [INFO ] Flow matrix only has 290 transitions (discarded 2050 similar events)
[2024-05-21 22:23:44] [INFO ] Invariant cache hit.
[2024-05-21 22:23:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:23:45] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1491 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/136 places, 2340/2340 transitions.
Applied a total of 0 rules in 224 ms. Remains 134 /134 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1896 ms. Remains : 134/136 places, 2340/2340 transitions.
[2024-05-21 22:23:45] [INFO ] Flow matrix only has 290 transitions (discarded 2050 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-05-21 22:23:45] [INFO ] Computed 5 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2317 resets) in 6399 ms. (156 steps per ms)
BEST_FIRST walk for 2000000 steps (1614 resets) in 4398 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 22:23:56] [INFO ] Flow matrix only has 290 transitions (discarded 2050 similar events)
[2024-05-21 22:23:56] [INFO ] Invariant cache hit.
[2024-05-21 22:23:56] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 22:23:56] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-21 22:23:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:23:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 22:23:56] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-21 22:23:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:23:56] [INFO ] [Nat]Added 42 Read/Feed constraints in 39 ms returned sat
[2024-05-21 22:23:56] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 1 ms to minimize.
[2024-05-21 22:23:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2024-05-21 22:23:56] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 58 ms.
[2024-05-21 22:23:57] [INFO ] Added : 21 causal constraints over 5 iterations in 267 ms. Result :sat
Minimization took 276 ms.
[2024-05-21 22:23:57] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 22:23:57] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-21 22:23:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:23:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:23:57] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-21 22:23:57] [INFO ] [Nat]Added 42 Read/Feed constraints in 33 ms returned sat
[2024-05-21 22:23:57] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 71 ms.
[2024-05-21 22:23:58] [INFO ] Added : 21 causal constraints over 20 iterations in 418 ms. Result :sat
Minimization took 188 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2340/2340 transitions.
Applied a total of 0 rules in 204 ms. Remains 134 /134 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 134/134 places, 2340/2340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2340/2340 transitions.
Applied a total of 0 rules in 193 ms. Remains 134 /134 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
[2024-05-21 22:24:00] [INFO ] Flow matrix only has 290 transitions (discarded 2050 similar events)
[2024-05-21 22:24:00] [INFO ] Invariant cache hit.
[2024-05-21 22:24:00] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-21 22:24:00] [INFO ] Flow matrix only has 290 transitions (discarded 2050 similar events)
[2024-05-21 22:24:00] [INFO ] Invariant cache hit.
[2024-05-21 22:24:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:24:01] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2024-05-21 22:24:01] [INFO ] Redundant transitions in 113 ms returned []
Running 2337 sub problems to find dead transitions.
[2024-05-21 22:24:01] [INFO ] Flow matrix only has 290 transitions (discarded 2050 similar events)
[2024-05-21 22:24:01] [INFO ] Invariant cache hit.
[2024-05-21 22:24:01] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2337 unsolved
[2024-05-21 22:24:27] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2024-05-21 22:24:44] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 1 ms to minimize.
Problem TDEAD1408 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1828 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/424 variables, and 7 constraints, problems are : Problem set: 21 solved, 2316 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2337/2337 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 21 solved, 2316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 21 solved, 2316 unsolved
Problem TDEAD1849 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2080 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2248 is UNSAT
Problem TDEAD2269 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 2/7 constraints. Problems are: Problem set: 42 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/424 variables, and 7 constraints, problems are : Problem set: 42 solved, 2295 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2337 constraints, Known Traps: 2/2 constraints]
After SMT, in 78157ms problems are : Problem set: 42 solved, 2295 unsolved
Search for dead transitions found 42 dead transitions in 78182ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/134 places, 2298/2340 transitions.
Applied a total of 0 rules in 225 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-05-21 22:25:19] [INFO ] Redundant transitions in 41 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 79905 ms. Remains : 134/134 places, 2298/2340 transitions.
[2024-05-21 22:25:19] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 134 cols
[2024-05-21 22:25:19] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 5822 ms. (171 steps per ms)
BEST_FIRST walk for 2000002 steps (1621 resets) in 4278 ms. (467 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 22:25:29] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:25:29] [INFO ] Invariant cache hit.
[2024-05-21 22:25:29] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 22:25:29] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-21 22:25:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 22:25:30] [INFO ] [Real]Added 41 Read/Feed constraints in 42 ms returned sat
[2024-05-21 22:25:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:25:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:25:30] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-21 22:25:30] [INFO ] [Nat]Added 41 Read/Feed constraints in 46 ms returned sat
[2024-05-21 22:25:30] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 97 ms.
[2024-05-21 22:25:30] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 1 ms to minimize.
[2024-05-21 22:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2024-05-21 22:25:30] [INFO ] Added : 21 causal constraints over 5 iterations in 653 ms. Result :sat
Minimization took 195 ms.
[2024-05-21 22:25:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:25:31] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-21 22:25:31] [INFO ] [Real]Added 41 Read/Feed constraints in 27 ms returned sat
[2024-05-21 22:25:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:25:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:25:31] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-21 22:25:31] [INFO ] [Nat]Added 41 Read/Feed constraints in 39 ms returned sat
[2024-05-21 22:25:31] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 83 ms.
[2024-05-21 22:25:31] [INFO ] Added : 21 causal constraints over 20 iterations in 439 ms. Result :sat
Minimization took 347 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 205 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 134/134 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 181 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-05-21 22:25:33] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:25:33] [INFO ] Invariant cache hit.
[2024-05-21 22:25:34] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-21 22:25:34] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:25:34] [INFO ] Invariant cache hit.
[2024-05-21 22:25:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 22:25:35] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
[2024-05-21 22:25:35] [INFO ] Redundant transitions in 144 ms returned []
Running 2295 sub problems to find dead transitions.
[2024-05-21 22:25:35] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:25:35] [INFO ] Invariant cache hit.
[2024-05-21 22:25:35] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 22:26:04] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 79490ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 79524ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81349 ms. Remains : 134/134 places, 2298/2298 transitions.
RANDOM walk for 40000 steps (92 resets) in 1341 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 300 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40007 steps (28 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
[2024-05-21 22:26:55] [INFO ] Flatten gal took : 336 ms
BEST_FIRST walk for 40002 steps (28 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
[2024-05-21 22:26:55] [INFO ] Flatten gal took : 161 ms
[2024-05-21 22:26:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1978709164757271737.gal : 57 ms
[2024-05-21 22:26:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7886939428680241837.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/ReachabilityCardinality1978709164757271737.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7886939428680241837.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 ...328
Loading property file /tmp/ReachabilityCardinality7886939428680241837.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 20
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :20 after 47
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :47 after 98
Interrupted probabilistic random walk after 253217 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 4
Probabilistic random walk after 253217 steps, saw 67863 distinct states, run finished after 3008 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-21 22:26:58] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:26:58] [INFO ] Invariant cache hit.
[2024-05-21 22:26:58] [INFO ] State equation strengthened by 41 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) 293/398 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/400 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 23/423 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 22:26:59] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2024-05-21 22:26:59] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1192 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 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) 293/398 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/400 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 23/423 variables, 23/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 186 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1303 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 2540ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1484 ms.
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 226 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 22:27:03] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:27:03] [INFO ] Invariant cache hit.
[2024-05-21 22:27:03] [INFO ] State equation strengthened by 41 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :98 after 2432
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 22:27:29] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved

BK_STOP 1716330477484

--------------------
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-PT-V50P50N20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V50P50N20, 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 r048-tajo-171620399100261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N20.tgz
mv BridgeAndVehicles-PT-V50P50N20 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;