fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r048-tajo-171620399200277
Last Updated
July 7, 2024

About the Execution of ITS-Tools for BridgeAndVehicles-PT-V80P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 400778.00 0.00 0.00 80 1 20 80 ? 80 80 1 1 1 80 80 1 1 20 80 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399200277.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-V80P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399200277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K Apr 13 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 330K Apr 13 00:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 00:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 885K Apr 13 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 13 01:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K 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 1.7M 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-V80P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716330406534

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-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 22:26:48] [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:26:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:26:48] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2024-05-21 22:26:48] [INFO ] Transformed 188 places.
[2024-05-21 22:26:48] [INFO ] Transformed 2108 transitions.
[2024-05-21 22:26:48] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 556 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Reduction of identical properties reduced properties to check from 16 to 12
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[80, 20, 0, 0, 0, 80, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[80, 20, 0, 0, 0, 80, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 22:26:49] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 22:26:49] [INFO ] Computed 7 invariants in 40 ms
Current structural bounds on expressions (after invariants) : Max Seen:[80, 20, 0, 0, 0, 80, 0, 0, 0, 0, 0] Max Struct:[80, 20, 80, 20, 80, 80, 2, 1, 1, 1, 1]
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-11 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-15 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (14 resets) in 310 ms. (32 steps per ms)
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (11 resets) in 93 ms. (212 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 1] Max Struct:[20, 2]
[2024-05-21 22:26:49] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 22:26:49] [INFO ] Invariant cache hit.
[2024-05-21 22:26:50] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-05-21 22:26:50] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2024-05-21 22:26:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 22:26:50] [INFO ] [Real]Added 22 Read/Feed constraints in 59 ms returned sat
[2024-05-21 22:26:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:26:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 22:26:50] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-21 22:26:50] [INFO ] [Nat]Added 22 Read/Feed constraints in 74 ms returned sat
[2024-05-21 22:26:51] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 106 ms.
[2024-05-21 22:26:51] [INFO ] Added : 10 causal constraints over 2 iterations in 333 ms. Result :sat
Minimization took 247 ms.
[2024-05-21 22:26:51] [INFO ] [Real]Absence check using 7 positive place invariants in 49 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10, 1] Max Struct:[20, 1]
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 412 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
Running 2104 sub problems to find dead transitions.
[2024-05-21 22:26:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-21 22:26:52] [INFO ] Computed 5 invariants in 10 ms
[2024-05-21 22:26:52] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-21 22:27:21] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 1/1 constraints]
After SMT, in 56742ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 56855ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57306 ms. Remains : 185/188 places, 2107/2108 transitions.
[2024-05-21 22:27:49] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 22:27:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (1643 resets) in 6657 ms. (150 steps per ms)
BEST_FIRST walk for 1000001 steps (696 resets) in 2556 ms. (391 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 22:27:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 22:27:58] [INFO ] Invariant cache hit.
[2024-05-21 22:27:58] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 22:27:58] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-21 22:27:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 22:27:59] [INFO ] [Real]Added 22 Read/Feed constraints in 17 ms returned sat
[2024-05-21 22:27:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:27:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:27:59] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-21 22:27:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 36 ms returned sat
[2024-05-21 22:27:59] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 77 ms.
[2024-05-21 22:27:59] [INFO ] Added : 11 causal constraints over 3 iterations in 442 ms. Result :sat
Minimization took 245 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 357 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 215 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-21 22:28:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 22:28:00] [INFO ] Invariant cache hit.
[2024-05-21 22:28:01] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-21 22:28:01] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 22:28:01] [INFO ] Invariant cache hit.
[2024-05-21 22:28:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 22:28:02] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1420 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 182 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1820 ms. Remains : 183/185 places, 2107/2107 transitions.
[2024-05-21 22:28:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-05-21 22:28:02] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (1643 resets) in 5590 ms. (178 steps per ms)
BEST_FIRST walk for 1000001 steps (696 resets) in 2519 ms. (396 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 22:28:10] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 22:28:10] [INFO ] Invariant cache hit.
[2024-05-21 22:28:10] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 22:28:10] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-21 22:28:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 22:28:10] [INFO ] [Real]Added 22 Read/Feed constraints in 28 ms returned sat
[2024-05-21 22:28:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:28:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 22:28:10] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-21 22:28:10] [INFO ] [Nat]Added 22 Read/Feed constraints in 41 ms returned sat
[2024-05-21 22:28:11] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 2 ms to minimize.
[2024-05-21 22:28:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2024-05-21 22:28:11] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 80 ms.
[2024-05-21 22:28:11] [INFO ] Added : 10 causal constraints over 2 iterations in 491 ms. Result :sat
Minimization took 295 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 334 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 196 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-21 22:28:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 22:28:12] [INFO ] Invariant cache hit.
[2024-05-21 22:28:13] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 22:28:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 22:28:13] [INFO ] Invariant cache hit.
[2024-05-21 22:28:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 22:28:14] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
[2024-05-21 22:28:14] [INFO ] Redundant transitions in 97 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-21 22:28:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 22:28:14] [INFO ] Invariant cache hit.
[2024-05-21 22:28:14] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-21 22:28:37] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 4 ms to minimize.
[2024-05-21 22:28:54] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 23 ms to minimize.
Problem TDEAD1067 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1463 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/552 variables, and 7 constraints, problems are : Problem set: 37 solved, 2067 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 37 solved, 2067 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 37 solved, 2067 unsolved
Problem TDEAD1474 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1936 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/552 variables, and 7 constraints, problems are : Problem set: 80 solved, 2024 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 2/2 constraints]
After SMT, in 75364ms problems are : Problem set: 80 solved, 2024 unsolved
Search for dead transitions found 80 dead transitions in 75388ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/183 places, 2027/2107 transitions.
Applied a total of 0 rules in 196 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 22:29:29] [INFO ] Redundant transitions in 99 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77207 ms. Remains : 183/183 places, 2027/2107 transitions.
[2024-05-21 22:29:29] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-05-21 22:29:29] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (1643 resets) in 5395 ms. (185 steps per ms)
BEST_FIRST walk for 1000001 steps (696 resets) in 2339 ms. (427 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 22:29:37] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 22:29:37] [INFO ] Invariant cache hit.
[2024-05-21 22:29:37] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 22:29:37] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-21 22:29:37] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 22:29:37] [INFO ] [Real]Added 21 Read/Feed constraints in 25 ms returned sat
[2024-05-21 22:29:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:29:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 22:29:38] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-21 22:29:38] [INFO ] [Nat]Added 21 Read/Feed constraints in 39 ms returned sat
[2024-05-21 22:29:38] [INFO ] Deduced a trap composed of 5 places in 676 ms of which 54 ms to minimize.
[2024-05-21 22:29:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 785 ms
[2024-05-21 22:29:39] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 81 ms.
[2024-05-21 22:29:39] [INFO ] Added : 11 causal constraints over 3 iterations in 392 ms. Result :sat
Minimization took 1025 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 121 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 140 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 22:29:43] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 22:29:43] [INFO ] Invariant cache hit.
[2024-05-21 22:29:44] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-21 22:29:44] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 22:29:44] [INFO ] Invariant cache hit.
[2024-05-21 22:29:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 22:29:45] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
[2024-05-21 22:29:45] [INFO ] Redundant transitions in 32 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-05-21 22:29:45] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 22:29:45] [INFO ] Invariant cache hit.
[2024-05-21 22:29:45] [INFO ] State equation strengthened by 21 read => feed constraints.
SMT process timed out in 46171ms, After SMT, problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 46197ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47797 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 1120 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (25 resets) in 1621 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (25 resets) in 396 ms. (100 steps per ms) remains 2/2 properties
[2024-05-21 22:30:37] [INFO ] Flatten gal took : 1890 ms
[2024-05-21 22:30:37] [INFO ] Flatten gal took : 152 ms
[2024-05-21 22:30:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7476611768655759218.gal : 364 ms
[2024-05-21 22:30:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1369459287156416287.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/ReachabilityCardinality7476611768655759218.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1369459287156416287.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/ReachabilityCardinality1369459287156416287.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 525029 steps, run timeout after 9001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 525029 steps, saw 145347 distinct states, run finished after 9004 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-21 22:30:44] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 566
[2024-05-21 22:30:44] [INFO ] Invariant cache hit.
[2024-05-21 22:30:44] [INFO ] State equation strengthened by 21 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) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/274 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 114/388 variables, 16/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :566 after 709
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:30:46] [INFO ] Deduced a trap composed of 5 places in 399 ms of which 4 ms to minimize.
[2024-05-21 22:30:46] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 162/550 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 11/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/551 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1725 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 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) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/274 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/388 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/550 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/550 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/551 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2403 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 4183ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 234 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 150 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 22:30:49] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 22:30:49] [INFO ] Invariant cache hit.
[2024-05-21 22:30:49] [INFO ] State equation strengthened by 21 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :709 after 2766
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 22:31:14] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2766 after 10936
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Detected timeout of ITS tools.
[2024-05-21 22:31:29] [INFO ] Flatten gal took : 89 ms
[2024-05-21 22:31:29] [INFO ] Applying decomposition
[2024-05-21 22:31:29] [INFO ] Flatten gal took : 88 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/graph1853801015761115607.txt' '-o' '/tmp/graph1853801015761115607.bin' '-w' '/tmp/graph1853801015761115607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1853801015761115607.bin' '-l' '-1' '-v' '-w' '/tmp/graph1853801015761115607.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:31:29] [INFO ] Decomposing Gal with order
[2024-05-21 22:31:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:31:30] [INFO ] Removed a total of 4403 redundant transitions.
[2024-05-21 22:31:30] [INFO ] Flatten gal took : 793 ms
[2024-05-21 22:31:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 461 labels/synchronizations in 66 ms.
[2024-05-21 22:31:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5549393971943418939.gal : 7 ms
[2024-05-21 22:31:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15652256967426582986.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/ReachabilityCardinality5549393971943418939.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15652256967426582986.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/ReachabilityCardinality15652256967426582986.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 34
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :34 after 43
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :43 after 118
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :118 after 509
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :509 after 2017
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2017 after 11137
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :11137 after 11361
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :11361 after 26483
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :26483 after 104242
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :104242 after 169507
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :169507 after 359558
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 56441ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 56470ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56632 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40002 steps (64 resets) in 816 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (24 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40005 steps (24 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 243273 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 243273 steps, saw 67749 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-21 22:31:49] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 22:31:49] [INFO ] Invariant cache hit.
[2024-05-21 22:31:49] [INFO ] State equation strengthened by 21 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) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/274 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 114/388 variables, 16/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:31:49] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2024-05-21 22:31:49] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 162/550 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 11/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/551 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 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) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :6.37213e+06 after 8.92375e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/274 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/388 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/550 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/550 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/551 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1743 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2463ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 360 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 191 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 174 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 22:31:52] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 22:31:52] [INFO ] Invariant cache hit.
[2024-05-21 22:31:53] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-21 22:31:53] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 22:31:53] [INFO ] Invariant cache hit.
[2024-05-21 22:31:53] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 22:31:53] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
[2024-05-21 22:31:53] [INFO ] Redundant transitions in 36 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-05-21 22:31:53] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 22:31:53] [INFO ] Invariant cache hit.
[2024-05-21 22:31:53] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 22:32:18] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 76354ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 76374ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77863 ms. Remains : 183/183 places, 2027/2027 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[20]
Starting property specific reduction for BridgeAndVehicles-PT-V80P20N10-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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-05-21 22:33:10] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 22:33:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (16 resets) in 62 ms. (158 steps per ms)
BEST_FIRST walk for 10000 steps (6 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 22:33:10] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 22:33:10] [INFO ] Invariant cache hit.
[2024-05-21 22:33:10] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:33:10] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-21 22:33:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 22:33:10] [INFO ] [Real]Added 21 Read/Feed constraints in 19 ms returned sat
[2024-05-21 22:33:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:33:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:33:10] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-21 22:33:10] [INFO ] [Nat]Added 21 Read/Feed constraints in 41 ms returned sat
[2024-05-21 22:33:11] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 1 ms to minimize.
[2024-05-21 22:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2024-05-21 22:33:11] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 42 ms.
[2024-05-21 22:33:11] [INFO ] Added : 11 causal constraints over 3 iterations in 294 ms. Result :sat
Minimization took 290 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 125 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 22:33:12] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 22:33:12] [INFO ] Invariant cache hit.
[2024-05-21 22:33:12] [INFO ] State equation strengthened by 21 read => feed constraints.

BK_STOP 1716330807312

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-V80P20N10"
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-V80P20N10, 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-171620399200277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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