Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.6K Apr 13 02:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 02:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 435K Apr 13 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 13 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 256K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 787K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 13 04:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 213K Apr 13 04:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Apr 13 03:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Apr 22 14:29 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.9M 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-V20P20N50-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716327897513

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-V20P20N50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 21:44:58] [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 21:44:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:44:59] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2024-05-21 21:44:59] [INFO ] Transformed 108 places.
[2024-05-21 21:44:59] [INFO ] Transformed 2228 transitions.
[2024-05-21 21:44:59] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 13
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 20, 0, 0, 0, 0, 20, 0, 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, 20, 0, 0, 0, 0, 20, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 21:44:59] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 21:44:59] [INFO ] Computed 7 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 20, 0, 0, 0, 0, 20, 0, 0] Max Struct:[20, 20, 2, 20, 20, 20, 1, 1, 1, 20, 1, 1]
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (57 resets) in 227 ms. (43 steps per ms)
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (58 resets) in 94 ms. (315 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[2, 1]
[2024-05-21 21:44:59] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2024-05-21 21:44:59] [INFO ] Invariant cache hit.
[2024-05-21 21:44:59] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2024-05-21 21:44:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 21:44:59] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-21 21:45:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 21:45:00] [INFO ] [Real]Added 102 Read/Feed constraints in 35 ms returned sat
[2024-05-21 21:45:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:45:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 21:45:00] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-21 21:45:00] [INFO ] [Nat]Added 102 Read/Feed constraints in 40 ms returned sat
[2024-05-21 21:45:00] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 197 transitions) in 191 ms.
[2024-05-21 21:45:00] [INFO ] Added : 25 causal constraints over 6 iterations in 426 ms. Result :sat
Minimization took 204 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 108 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place COMPTEUR_40) removed 42 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2186/2186 transitions.
Graph (complete) has 874 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2144
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 104 transition count 2102
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 103 transition count 2060
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5 place count 102 transition count 2018
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6 place count 101 transition count 1976
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 7 place count 100 transition count 1934
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 8 place count 99 transition count 1892
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 9 place count 98 transition count 1850
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 10 place count 97 transition count 1808
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 11 place count 96 transition count 1766
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 12 place count 95 transition count 1765
Iterating global reduction 10 with 1 rules applied. Total rules applied 13 place count 95 transition count 1765
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 16 place count 93 transition count 1764
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 20 place count 91 transition count 1762
Applied a total of 20 rules in 439 ms. Remains 91 /108 variables (removed 17) and now considering 1762/2186 (removed 424) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 91/108 places, 1762/2186 transitions.
[2024-05-21 21:45:02] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
// Phase 1: matrix 242 rows 91 cols
[2024-05-21 21:45:02] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (8020 resets) in 6075 ms. (164 steps per ms)
BEST_FIRST walk for 1000000 steps (3324 resets) in 2940 ms. (340 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:45:11] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 21:45:11] [INFO ] Invariant cache hit.
[2024-05-21 21:45:11] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-21 21:45:11] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-21 21:45:11] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 21:45:11] [INFO ] [Real]Added 80 Read/Feed constraints in 52 ms returned sat
[2024-05-21 21:45:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:45:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 21:45:11] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-21 21:45:11] [INFO ] [Nat]Added 80 Read/Feed constraints in 35 ms returned sat
[2024-05-21 21:45:11] [INFO ] Computed and/alt/rep : 79/156/79 causal constraints (skipped 160 transitions) in 81 ms.
[2024-05-21 21:45:11] [INFO ] Added : 27 causal constraints over 7 iterations in 226 ms. Result :sat
Minimization took 145 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 1762/1762 transitions.
Applied a total of 0 rules in 181 ms. Remains 91 /91 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 91/91 places, 1762/1762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 1762/1762 transitions.
Applied a total of 0 rules in 176 ms. Remains 91 /91 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
[2024-05-21 21:45:12] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 21:45:12] [INFO ] Invariant cache hit.
[2024-05-21 21:45:13] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-21 21:45:13] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 21:45:13] [INFO ] Invariant cache hit.
[2024-05-21 21:45:13] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 21:45:14] [INFO ] Implicit Places using invariants and state equation in 948 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1303 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/91 places, 1762/1762 transitions.
Applied a total of 0 rules in 174 ms. Remains 89 /89 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1658 ms. Remains : 89/91 places, 1762/1762 transitions.
[2024-05-21 21:45:14] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
// Phase 1: matrix 242 rows 89 cols
[2024-05-21 21:45:14] [INFO ] Computed 4 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (8022 resets) in 6825 ms. (146 steps per ms)
BEST_FIRST walk for 1000001 steps (3319 resets) in 2531 ms. (394 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:45:23] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 21:45:23] [INFO ] Invariant cache hit.
[2024-05-21 21:45:23] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 21:45:23] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-21 21:45:23] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 21:45:23] [INFO ] [Real]Added 80 Read/Feed constraints in 36 ms returned sat
[2024-05-21 21:45:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:45:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 21:45:24] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-21 21:45:24] [INFO ] [Nat]Added 80 Read/Feed constraints in 17 ms returned sat
[2024-05-21 21:45:24] [INFO ] Computed and/alt/rep : 79/156/79 causal constraints (skipped 160 transitions) in 106 ms.
[2024-05-21 21:45:24] [INFO ] Added : 31 causal constraints over 7 iterations in 275 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1762/1762 transitions.
Applied a total of 0 rules in 169 ms. Remains 89 /89 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 89/89 places, 1762/1762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1762/1762 transitions.
Applied a total of 0 rules in 172 ms. Remains 89 /89 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
[2024-05-21 21:45:25] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 21:45:25] [INFO ] Invariant cache hit.
[2024-05-21 21:45:25] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-21 21:45:25] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 21:45:25] [INFO ] Invariant cache hit.
[2024-05-21 21:45:25] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 21:45:26] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2024-05-21 21:45:26] [INFO ] Redundant transitions in 134 ms returned []
Running 1759 sub problems to find dead transitions.
[2024-05-21 21:45:26] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 21:45:26] [INFO ] Invariant cache hit.
[2024-05-21 21:45:26] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
[2024-05-21 21:45:54] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 9 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1442 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 89/331 variables, and 5 constraints, problems are : Problem set: 33 solved, 1726 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/89 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 1759/1759 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 33 solved, 1726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 33 solved, 1726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 33 solved, 1726 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 33 solved, 1726 unsolved
Problem TDEAD1482 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1722 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/5 constraints. Problems are: Problem set: 40 solved, 1719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 40 solved, 1719 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 5 (OVERLAPS) 242/331 variables, 89/94 constraints. Problems are: Problem set: 42 solved, 1717 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 80/174 constraints. Problems are: Problem set: 42 solved, 1717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/331 variables, and 1891 constraints, problems are : Problem set: 42 solved, 1717 unsolved in 33414 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1717/1759 constraints, Known Traps: 1/1 constraints]
After SMT, in 73719ms problems are : Problem set: 42 solved, 1717 unsolved
Search for dead transitions found 42 dead transitions in 73773ms
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 : 89/89 places, 1720/1762 transitions.
Applied a total of 0 rules in 148 ms. Remains 89 /89 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2024-05-21 21:46:40] [INFO ] Redundant transitions in 90 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 75502 ms. Remains : 89/89 places, 1720/1762 transitions.
[2024-05-21 21:46:40] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
// Phase 1: matrix 238 rows 89 cols
[2024-05-21 21:46:40] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (8020 resets) in 6023 ms. (166 steps per ms)
BEST_FIRST walk for 1000000 steps (3321 resets) in 2534 ms. (394 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:46:48] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 21:46:48] [INFO ] Invariant cache hit.
[2024-05-21 21:46:49] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 21:46:49] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-21 21:46:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 21:46:49] [INFO ] [Real]Added 78 Read/Feed constraints in 42 ms returned sat
[2024-05-21 21:46:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:46:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 21:46:49] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-21 21:46:49] [INFO ] [Nat]Added 78 Read/Feed constraints in 29 ms returned sat
[2024-05-21 21:46:49] [INFO ] Computed and/alt/rep : 77/154/77 causal constraints (skipped 158 transitions) in 61 ms.
[2024-05-21 21:46:49] [INFO ] Added : 32 causal constraints over 8 iterations in 286 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1720/1720 transitions.
Applied a total of 0 rules in 160 ms. Remains 89 /89 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 89/89 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1720/1720 transitions.
Applied a total of 0 rules in 158 ms. Remains 89 /89 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2024-05-21 21:46:50] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 21:46:50] [INFO ] Invariant cache hit.
[2024-05-21 21:46:50] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-21 21:46:50] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 21:46:50] [INFO ] Invariant cache hit.
[2024-05-21 21:46:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 21:46:51] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
[2024-05-21 21:46:51] [INFO ] Redundant transitions in 74 ms returned []
Running 1717 sub problems to find dead transitions.
[2024-05-21 21:46:51] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 21:46:51] [INFO ] Invariant cache hit.
[2024-05-21 21:46:51] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 89/327 variables, and 4 constraints, problems are : Problem set: 0 solved, 1717 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/89 constraints, ReadFeed: 0/78 constraints, PredecessorRefiner: 1717/1717 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1717 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 4 (OVERLAPS) 238/327 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
SMT process timed out in 71492ms, After SMT, problems are : Problem set: 0 solved, 1717 unsolved
Search for dead transitions found 0 dead transitions in 71520ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72957 ms. Remains : 89/89 places, 1720/1720 transitions.
RANDOM walk for 40000 steps (320 resets) in 1664 ms. (24 steps per ms) remains 2/2 properties
[2024-05-21 21:48:03] [INFO ] Flatten gal took : 332 ms
BEST_FIRST walk for 40004 steps (131 resets) in 471 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (131 resets) in 390 ms. (102 steps per ms) remains 2/2 properties
[2024-05-21 21:48:04] [INFO ] Flatten gal took : 235 ms
[2024-05-21 21:48:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1440907609561063455.gal : 100 ms
[2024-05-21 21:48:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality136245984767353574.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/ReachabilityCardinality1440907609561063455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality136245984767353574.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 ...327
Loading property file /tmp/ReachabilityCardinality136245984767353574.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 20
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 56
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :56 after 110
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :110 after 272
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :272 after 952
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :952 after 1124
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1124 after 1572
Interrupted probabilistic random walk after 309566 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 309566 steps, saw 88158 distinct states, run finished after 3004 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-21 21:48:07] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 21:48:07] [INFO ] Invariant cache hit.
[2024-05-21 21:48:07] [INFO ] State equation strengthened by 78 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/243 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/325 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/327 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/243 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/325 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/327 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/327 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 787ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1720/1720 transitions.
Applied a total of 0 rules in 109 ms. Remains 89 /89 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 89/89 places, 1720/1720 transitions.
RANDOM walk for 40000 steps (320 resets) in 941 ms. (42 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (133 resets) in 415 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (131 resets) in 345 ms. (115 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1572 after 3472
Interrupted probabilistic random walk after 287430 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 287430 steps, saw 81721 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2024-05-21 21:48:11] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 21:48:11] [INFO ] Invariant cache hit.
[2024-05-21 21:48:11] [INFO ] State equation strengthened by 78 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/243 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/325 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/327 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/243 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/325 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/327 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/327 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 713ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1720/1720 transitions.
Applied a total of 0 rules in 141 ms. Remains 89 /89 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 89/89 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1720/1720 transitions.
Applied a total of 0 rules in 115 ms. Remains 89 /89 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2024-05-21 21:48:12] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 21:48:12] [INFO ] Invariant cache hit.
[2024-05-21 21:48:12] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-21 21:48:12] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 21:48:12] [INFO ] Invariant cache hit.
[2024-05-21 21:48:13] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 21:48:13] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
[2024-05-21 21:48:13] [INFO ] Redundant transitions in 42 ms returned []
Running 1717 sub problems to find dead transitions.
[2024-05-21 21:48:13] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 21:48:13] [INFO ] Invariant cache hit.
[2024-05-21 21:48:13] [INFO ] State equation strengthened by 78 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3472 after 26182
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 89/327 variables, and 4 constraints, problems are : Problem set: 0 solved, 1717 unsolved in 30113 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/89 constraints, ReadFeed: 0/78 constraints, PredecessorRefiner: 1717/1717 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1717 unsolved
Detected timeout of ITS tools.
[2024-05-21 21:48:55] [INFO ] Flatten gal took : 96 ms
[2024-05-21 21:48:55] [INFO ] Applying decomposition
[2024-05-21 21:48:55] [INFO ] Flatten gal took : 75 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
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/graph391099288712067197.txt' '-o' '/tmp/graph391099288712067197.bin' '-w' '/tmp/graph391099288712067197.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph391099288712067197.bin' '-l' '-1' '-v' '-w' '/tmp/graph391099288712067197.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:48:56] [INFO ] Decomposing Gal with order
[2024-05-21 21:48:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:48:56] [INFO ] Removed a total of 3273 redundant transitions.
[2024-05-21 21:48:56] [INFO ] Flatten gal took : 604 ms
[2024-05-21 21:48:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 255 labels/synchronizations in 36 ms.
[2024-05-21 21:48:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17624068739388767902.gal : 12 ms
[2024-05-21 21:48:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15107124952035981830.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/ReachabilityCardinality17624068739388767902.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15107124952035981830.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality15107124952035981830.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :32 after 57
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :57 after 102
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :102 after 167
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :167 after 244
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :244 after 664
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :664 after 2740
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2740 after 5357
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :12296 after 12616
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :63596 after 63876
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.19558e+06 after 1.24681e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.48936e+06,10.9463,176472,709,4822,83520,144326,65,248435,324,2.20421e+06,0
Total reachable state count : 1489362

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,10.9474,176472,1,0,83520,144326,65,248435,325,2.20421e+06,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,10.9482,176472,1,0,83520,144326,68,248435,326,2.20421e+06,0
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 89/327 variables, and 4 constraints, problems are : Problem set: 0 solved, 1717 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/89 constraints, ReadFeed: 0/78 constraints, PredecessorRefiner: 0/1717 constraints, Known Traps: 0/0 constraints]
After SMT, in 71572ms problems are : Problem set: 0 solved, 1717 unsolved
Search for dead transitions found 0 dead transitions in 71598ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72837 ms. Remains : 89/89 places, 1720/1720 transitions.
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-13 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 266535 ms.

BK_STOP 1716328165513

--------------------
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-V20P20N50"
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-V20P20N50, 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-171620399000221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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