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-171620399000197.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-V20P10N50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399000197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 16K Apr 13 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 400K Apr 13 02:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 13 02:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 144K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 886K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.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.8M 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-V20P10N50-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716326518147

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-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 21:21:59] [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:21:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:21:59] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2024-05-21 21:21:59] [INFO ] Transformed 108 places.
[2024-05-21 21:21:59] [INFO ] Transformed 2228 transitions.
[2024-05-21 21:21:59] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Reduction of identical properties reduced properties to check from 16 to 14
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 20, 10, 0, 0, 0, 0, 0, 0, 0, 20] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 0, 20, 10, 0, 0, 0, 0, 0, 0, 0, 20] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 21:21:59] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 21:22:00] [INFO ] Computed 7 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 20, 10, 0, 0, 0, 0, 0, 0, 0, 20] Max Struct:[2, 2, 2, 20, 10, 20, 10, 20, 1, 20, 1, 10, 20]
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (57 resets) in 211 ms. (47 steps per ms)
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (108 resets) in 164 ms. (303 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 0, 6] Max Struct:[2, 2, 2, 1, 10]
[2024-05-21 21:22:00] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2024-05-21 21:22:00] [INFO ] Invariant cache hit.
[2024-05-21 21:22:00] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2024-05-21 21:22:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2024-05-21 21:22:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2024-05-21 21:22:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 21:22:01] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-21 21:22:01] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 21:22:01] [INFO ] [Real]Added 102 Read/Feed constraints in 68 ms returned sat
[2024-05-21 21:22:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-21 21:22:01] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-21 21:22:01] [INFO ] [Nat]Added 102 Read/Feed constraints in 52 ms returned sat
[2024-05-21 21:22:01] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 197 transitions) in 323 ms.
[2024-05-21 21:22:03] [INFO ] Deduced a trap composed of 6 places in 950 ms of which 37 ms to minimize.
[2024-05-21 21:22:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1057 ms
[2024-05-21 21:22:03] [INFO ] Added : 23 causal constraints over 6 iterations in 1851 ms. Result :sat
Minimization took 230 ms.
[2024-05-21 21:22:03] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 21:22:03] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-21 21:22:03] [INFO ] [Real]Added 102 Read/Feed constraints in 23 ms returned sat
[2024-05-21 21:22:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 21:22:04] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-21 21:22:04] [INFO ] [Nat]Added 102 Read/Feed constraints in 30 ms returned sat
[2024-05-21 21:22:04] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 197 transitions) in 353 ms.
[2024-05-21 21:22:04] [INFO ] Added : 31 causal constraints over 7 iterations in 734 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 0, 6] Max Struct:[1, 1, 1, 1, 10]
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL PARIKH_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_24) 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.10 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
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 12 place count 95 transition count 1724
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 13 place count 94 transition count 1682
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 14 place count 93 transition count 1640
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 15 place count 92 transition count 1598
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 16 place count 91 transition count 1556
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 17 place count 90 transition count 1514
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 18 place count 89 transition count 1472
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 19 place count 88 transition count 1430
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 20 place count 87 transition count 1388
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 21 place count 86 transition count 1346
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 22 place count 85 transition count 1304
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 23 place count 84 transition count 1262
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 24 place count 83 transition count 1220
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 25 place count 82 transition count 1178
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 26 place count 81 transition count 1136
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 27 place count 80 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 28 place count 79 transition count 1093
Iterating global reduction 26 with 1 rules applied. Total rules applied 29 place count 79 transition count 1093
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 26 with 3 rules applied. Total rules applied 32 place count 77 transition count 1092
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 26 with 4 rules applied. Total rules applied 36 place count 75 transition count 1090
Applied a total of 36 rules in 303 ms. Remains 75 /108 variables (removed 33) and now considering 1090/2186 (removed 1096) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 75/108 places, 1090/2186 transitions.
[2024-05-21 21:22:06] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
// Phase 1: matrix 178 rows 75 cols
[2024-05-21 21:22:06] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (8021 resets) in 3951 ms. (253 steps per ms)
BEST_FIRST walk for 1000000 steps (3318 resets) in 1714 ms. (583 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:22:12] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-05-21 21:22:12] [INFO ] Invariant cache hit.
[2024-05-21 21:22:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 21:22:12] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:22:12] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 21:22:12] [INFO ] [Real]Added 48 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:22:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 21:22:12] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-21 21:22:12] [INFO ] [Nat]Added 48 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:22:12] [INFO ] Computed and/alt/rep : 63/124/63 causal constraints (skipped 112 transitions) in 37 ms.
[2024-05-21 21:22:12] [INFO ] Added : 23 causal constraints over 6 iterations in 110 ms. Result :sat
Minimization took 65 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 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 1090/1090 transitions.
Applied a total of 0 rules in 134 ms. Remains 75 /75 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 75/75 places, 1090/1090 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 1090/1090 transitions.
Applied a total of 0 rules in 220 ms. Remains 75 /75 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2024-05-21 21:22:13] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-05-21 21:22:13] [INFO ] Invariant cache hit.
[2024-05-21 21:22:13] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-21 21:22:13] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-05-21 21:22:13] [INFO ] Invariant cache hit.
[2024-05-21 21:22:13] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 21:22:14] [INFO ] Implicit Places using invariants and state equation in 599 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 895 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/75 places, 1090/1090 transitions.
Applied a total of 0 rules in 55 ms. Remains 73 /73 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1174 ms. Remains : 73/75 places, 1090/1090 transitions.
[2024-05-21 21:22:14] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
// Phase 1: matrix 178 rows 73 cols
[2024-05-21 21:22:14] [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 (8021 resets) in 3836 ms. (260 steps per ms)
BEST_FIRST walk for 1000000 steps (3320 resets) in 1595 ms. (626 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:22:19] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-05-21 21:22:19] [INFO ] Invariant cache hit.
[2024-05-21 21:22:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 21:22:19] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:22:19] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 21:22:19] [INFO ] [Real]Added 48 Read/Feed constraints in 23 ms returned sat
[2024-05-21 21:22:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 21:22:20] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-21 21:22:20] [INFO ] [Nat]Added 48 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:22:20] [INFO ] Computed and/alt/rep : 63/124/63 causal constraints (skipped 112 transitions) in 39 ms.
[2024-05-21 21:22:20] [INFO ] Added : 21 causal constraints over 5 iterations in 126 ms. Result :sat
Minimization took 54 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 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1090/1090 transitions.
Applied a total of 0 rules in 60 ms. Remains 73 /73 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 73/73 places, 1090/1090 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1090/1090 transitions.
Applied a total of 0 rules in 66 ms. Remains 73 /73 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2024-05-21 21:22:20] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-05-21 21:22:20] [INFO ] Invariant cache hit.
[2024-05-21 21:22:20] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-21 21:22:20] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-05-21 21:22:20] [INFO ] Invariant cache hit.
[2024-05-21 21:22:20] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 21:22:21] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2024-05-21 21:22:21] [INFO ] Redundant transitions in 80 ms returned []
Running 1087 sub problems to find dead transitions.
[2024-05-21 21:22:21] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-05-21 21:22:21] [INFO ] Invariant cache hit.
[2024-05-21 21:22:21] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1087 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1087 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1087 unsolved
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1018 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 73/251 variables, and 5 constraints, problems are : Problem set: 38 solved, 1049 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/73 constraints, ReadFeed: 0/48 constraints, PredecessorRefiner: 1087/1087 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 38 solved, 1049 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 38 solved, 1049 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 38 solved, 1049 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 38 solved, 1049 unsolved
Problem TDEAD1042 is UNSAT
Problem TDEAD1066 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/5 constraints. Problems are: Problem set: 40 solved, 1047 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 40 solved, 1047 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 5 (OVERLAPS) 178/251 variables, 73/78 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 48/126 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1045/1171 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/251 variables, and 1171 constraints, problems are : Problem set: 42 solved, 1045 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1045/1087 constraints, Known Traps: 1/1 constraints]
After SMT, in 64373ms problems are : Problem set: 42 solved, 1045 unsolved
Search for dead transitions found 42 dead transitions in 64422ms
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 : 73/73 places, 1048/1090 transitions.
Applied a total of 0 rules in 39 ms. Remains 73 /73 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2024-05-21 21:23:25] [INFO ] Redundant transitions in 28 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65474 ms. Remains : 73/73 places, 1048/1090 transitions.
[2024-05-21 21:23:25] [INFO ] Flow matrix only has 174 transitions (discarded 874 similar events)
// Phase 1: matrix 174 rows 73 cols
[2024-05-21 21:23:25] [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 3475 ms. (287 steps per ms)
BEST_FIRST walk for 1000001 steps (3321 resets) in 1491 ms. (670 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:23:30] [INFO ] Flow matrix only has 174 transitions (discarded 874 similar events)
[2024-05-21 21:23:30] [INFO ] Invariant cache hit.
[2024-05-21 21:23:30] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 21:23:31] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 21:23:31] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 21:23:31] [INFO ] [Real]Added 46 Read/Feed constraints in 24 ms returned sat
[2024-05-21 21:23:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:23:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 21:23:31] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-21 21:23:31] [INFO ] [Nat]Added 46 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:23:31] [INFO ] Computed and/alt/rep : 61/122/61 causal constraints (skipped 110 transitions) in 28 ms.
[2024-05-21 21:23:31] [INFO ] Added : 20 causal constraints over 5 iterations in 108 ms. Result :sat
Minimization took 56 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 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1048/1048 transitions.
Applied a total of 0 rules in 48 ms. Remains 73 /73 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 73/73 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1048/1048 transitions.
Applied a total of 0 rules in 49 ms. Remains 73 /73 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2024-05-21 21:23:31] [INFO ] Flow matrix only has 174 transitions (discarded 874 similar events)
[2024-05-21 21:23:31] [INFO ] Invariant cache hit.
[2024-05-21 21:23:31] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-21 21:23:31] [INFO ] Flow matrix only has 174 transitions (discarded 874 similar events)
[2024-05-21 21:23:31] [INFO ] Invariant cache hit.
[2024-05-21 21:23:31] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 21:23:32] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2024-05-21 21:23:32] [INFO ] Redundant transitions in 10 ms returned []
Running 1045 sub problems to find dead transitions.
[2024-05-21 21:23:32] [INFO ] Flow matrix only has 174 transitions (discarded 874 similar events)
[2024-05-21 21:23:32] [INFO ] Invariant cache hit.
[2024-05-21 21:23:32] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
Problem TDEAD567 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 6 solved, 1039 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1045/1045 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1039 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 1039/1162 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
[2024-05-21 21:24:36] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 1 ms to minimize.
SMT process timed out in 64386ms, After SMT, problems are : Problem set: 6 solved, 1039 unsolved
Search for dead transitions found 6 dead transitions in 64396ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/73 places, 1042/1048 transitions.
Applied a total of 0 rules in 40 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-05-21 21:24:36] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65306 ms. Remains : 73/73 places, 1042/1048 transitions.
[2024-05-21 21:24:36] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-05-21 21:24:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (8021 resets) in 3551 ms. (281 steps per ms)
BEST_FIRST walk for 1000000 steps (3318 resets) in 1583 ms. (631 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:24:41] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-05-21 21:24:41] [INFO ] Invariant cache hit.
[2024-05-21 21:24:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 21:24:42] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:24:42] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 21:24:42] [INFO ] [Real]Added 46 Read/Feed constraints in 30 ms returned sat
[2024-05-21 21:24:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:24:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 21:24:42] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 21:24:42] [INFO ] [Nat]Added 46 Read/Feed constraints in 22 ms returned sat
[2024-05-21 21:24:42] [INFO ] Computed and/alt/rep : 61/122/61 causal constraints (skipped 110 transitions) in 27 ms.
[2024-05-21 21:24:42] [INFO ] Added : 20 causal constraints over 5 iterations in 96 ms. Result :sat
Minimization took 56 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 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 39 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 73/73 places, 1042/1042 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 37 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-05-21 21:24:42] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-05-21 21:24:42] [INFO ] Invariant cache hit.
[2024-05-21 21:24:42] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-21 21:24:42] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-05-21 21:24:42] [INFO ] Invariant cache hit.
[2024-05-21 21:24:42] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 21:24:43] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2024-05-21 21:24:43] [INFO ] Redundant transitions in 9 ms returned []
Running 1039 sub problems to find dead transitions.
[2024-05-21 21:24:43] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-05-21 21:24:43] [INFO ] Invariant cache hit.
[2024-05-21 21:24:43] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1039 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 1162 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30578 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints]
After SMT, in 64851ms problems are : Problem set: 0 solved, 1039 unsolved
Search for dead transitions found 0 dead transitions in 64874ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65671 ms. Remains : 73/73 places, 1042/1042 transitions.
RANDOM walk for 40000 steps (320 resets) in 1089 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (131 resets) in 413 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (132 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
[2024-05-21 21:25:48] [INFO ] Flatten gal took : 175 ms
[2024-05-21 21:25:48] [INFO ] Flatten gal took : 93 ms
[2024-05-21 21:25:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3871935933876663781.gal : 39 ms
[2024-05-21 21:25:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6907867504350425165.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/ReachabilityCardinality3871935933876663781.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6907867504350425165.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/ReachabilityCardinality6907867504350425165.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 306
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :924 after 964
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :964 after 1140
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1140 after 1788
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1788 after 3748
Interrupted probabilistic random walk after 388433 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 2
Probabilistic random walk after 388433 steps, saw 109277 distinct states, run finished after 3008 ms. (steps per millisecond=129 ) properties seen :0
[2024-05-21 21:25:51] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-05-21 21:25:51] [INFO ] Invariant cache hit.
[2024-05-21 21:25:51] [INFO ] State equation strengthened by 46 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) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/119 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/245 variables, 42/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 46/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/247 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 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) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/119 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/245 variables, 42/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/247 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/247 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 493ms 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 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 57 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 73/73 places, 1042/1042 transitions.
RANDOM walk for 40000 steps (320 resets) in 533 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (129 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (129 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :24724 after 24872
Interrupted probabilistic random walk after 399311 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 2
Probabilistic random walk after 399311 steps, saw 112212 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2024-05-21 21:25:55] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-05-21 21:25:55] [INFO ] Invariant cache hit.
[2024-05-21 21:25:55] [INFO ] State equation strengthened by 46 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) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/119 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/245 variables, 42/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 46/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/247 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 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) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/119 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/245 variables, 42/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/247 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/247 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 488ms 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 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 53 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 73/73 places, 1042/1042 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 45 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-05-21 21:25:56] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-05-21 21:25:56] [INFO ] Invariant cache hit.
[2024-05-21 21:25:56] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-21 21:25:56] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-05-21 21:25:56] [INFO ] Invariant cache hit.
[2024-05-21 21:25:56] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 21:25:56] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2024-05-21 21:25:56] [INFO ] Redundant transitions in 11 ms returned []
Running 1039 sub problems to find dead transitions.
[2024-05-21 21:25:56] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-05-21 21:25:56] [INFO ] Invariant cache hit.
[2024-05-21 21:25:56] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :71050 after 73236
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :307650 after 314042
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1039 unsolved
Detected timeout of ITS tools.
[2024-05-21 21:26:39] [INFO ] Flatten gal took : 80 ms
[2024-05-21 21:26:39] [INFO ] Applying decomposition
[2024-05-21 21:26:39] [INFO ] Flatten gal took : 54 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/graph14575080029883657337.txt' '-o' '/tmp/graph14575080029883657337.bin' '-w' '/tmp/graph14575080029883657337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14575080029883657337.bin' '-l' '-1' '-v' '-w' '/tmp/graph14575080029883657337.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:26:40] [INFO ] Decomposing Gal with order
[2024-05-21 21:26:40] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
[2024-05-21 21:26:40] [INFO ] Removed a total of 1917 redundant transitions.
[2024-05-21 21:26:40] [INFO ] Flatten gal took : 650 ms
[2024-05-21 21:26:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 183 labels/synchronizations in 42 ms.
[2024-05-21 21:26:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5830634259983396743.gal : 2 ms
[2024-05-21 21:26:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16765444318135175146.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/ReachabilityCardinality5830634259983396743.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16765444318135175146.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/ReachabilityCardinality16765444318135175146.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 20
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :20 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 44
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :44 after 149
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :149 after 684
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :684 after 1515
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1515 after 4601
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :9405 after 16646
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :42343 after 63302
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :269855 after 330709
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 1039 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,21.3332,386020,1339,6362,162161,289517,97,754820,223,4.7649e+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,21.3344,386020,1,0,162161,289517,97,754820,224,4.7649e+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,21.3355,386020,1,0,162161,289517,100,754820,225,4.7649e+06,0
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 1162 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 31073 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints]
After SMT, in 66025ms problems are : Problem set: 0 solved, 1039 unsolved
Search for dead transitions found 0 dead transitions in 66040ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66626 ms. Remains : 73/73 places, 1042/1042 transitions.
FORMULA BridgeAndVehicles-PT-V20P10N50-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 303368 ms.

BK_STOP 1716326823013

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

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