Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.8K Apr 13 01:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 01:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 00:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 00:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 01:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 13 01:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 13 01:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 45K 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-COL-V80P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716325162202

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P50N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-21 20:59:23] [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 20:59:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:59:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 20:59:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 20:59:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 704 ms
[2024-05-21 20:59:24] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-05-21 20:59:24] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 20:59:24] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 20:59:24] [INFO ] Computed 4 invariants in 9 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 0, 0, 1, 80, 0, 0] Max Struct:[80, 1, 50, 50, 80, 1, 80, 1, 80]
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-21 20:59:24] [INFO ] Invariant cache hit.
[2024-05-21 20:59:24] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-21 20:59:25] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 20:59:25] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 20:59:25] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 10 ms.
[2024-05-21 20:59:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 20:59:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-21 20:59:25] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 20:59:25] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2024-05-21 20:59:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 20:59:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-21 20:59:25] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 20:59:25] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 20:59:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 20:59:25] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-21 20:59:25] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 20:59:25] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-21 20:59:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 20:59:25] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 20:59:25] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 20:59:25] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 20:59:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 20:59:25] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 20:59:25] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 20:59:25] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[80, 50, 50, 80, 1, 80]
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 20:59:25] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 128 ms.
[2024-05-21 20:59:25] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[80, 50, 50, 80, 1, 80]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[80, 50, 50, 80, 1, 80]
[2024-05-21 20:59:25] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 20:59:25] [INFO ] Computed 7 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[80, 50, 50, 80, 1, 80]
RANDOM walk for 10000 steps (14 resets) in 236 ms. (42 steps per ms)
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-12 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-14 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (11 resets) in 64 ms. (307 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 6] Max Struct:[50, 50]
[2024-05-21 20:59:25] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 20:59:25] [INFO ] Invariant cache hit.
[2024-05-21 20:59:25] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 20:59:26] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-21 20:59:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:59:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 20:59:26] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-21 20:59:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 20:59:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 37 ms returned sat
[2024-05-21 20:59:26] [INFO ] Deduced a trap composed of 5 places in 350 ms of which 30 ms to minimize.
[2024-05-21 20:59:26] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2024-05-21 20:59:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 737 ms
[2024-05-21 20:59:27] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 93 ms.
[2024-05-21 20:59:27] [INFO ] Added : 10 causal constraints over 2 iterations in 189 ms. Result :sat
Minimization took 192 ms.
[2024-05-21 20:59:27] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-21 20:59:27] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-21 20:59:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:59:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 20:59:27] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-21 20:59:27] [INFO ] [Nat]Added 22 Read/Feed constraints in 43 ms returned sat
[2024-05-21 20:59:28] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 4 ms to minimize.
[2024-05-21 20:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2024-05-21 20:59:28] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 152 ms.
[2024-05-21 20:59:29] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 2 ms to minimize.
[2024-05-21 20:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2024-05-21 20:59:29] [INFO ] Added : 8 causal constraints over 8 iterations in 879 ms. Result :sat
Minimization took 338 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 6] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 463 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-05-21 20:59:30] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-05-21 20:59:30] [INFO ] Computed 5 invariants in 12 ms
[2024-05-21 20:59:30] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 20:59:57] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20120 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 56157ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 56233ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56758 ms. Remains : 186/188 places, 2108/2108 transitions.
[2024-05-21 21:00:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 21:00:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1423 resets) in 6953 ms. (143 steps per ms)
BEST_FIRST walk for 2000002 steps (1083 resets) in 5605 ms. (356 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2024-05-21 21:00:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 21:00:39] [INFO ] Invariant cache hit.
[2024-05-21 21:00:39] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 21:00:39] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-21 21:00:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 21:00:39] [INFO ] [Real]Added 22 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:00:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 21:00:39] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-21 21:00:39] [INFO ] [Nat]Added 22 Read/Feed constraints in 64 ms returned sat
[2024-05-21 21:00:39] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 77 ms.
[2024-05-21 21:00:40] [INFO ] Deduced a trap composed of 15 places in 367 ms of which 2 ms to minimize.
[2024-05-21 21:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 454 ms
[2024-05-21 21:00:40] [INFO ] Added : 10 causal constraints over 2 iterations in 736 ms. Result :sat
Minimization took 211 ms.
[2024-05-21 21:00:40] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 21:00:41] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-21 21:00:41] [INFO ] [Real]Added 22 Read/Feed constraints in 64 ms returned sat
[2024-05-21 21:00:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:00:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 21:00:41] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-05-21 21:00:41] [INFO ] [Nat]Added 22 Read/Feed constraints in 43 ms returned sat
[2024-05-21 21:00:41] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 2 ms to minimize.
[2024-05-21 21:00:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2024-05-21 21:00:41] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 80 ms.
[2024-05-21 21:00:42] [INFO ] Added : 12 causal constraints over 10 iterations in 387 ms. Result :sat
Minimization took 591 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 195 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 352 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-21 21:00:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 21:00:44] [INFO ] Invariant cache hit.
[2024-05-21 21:00:44] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-21 21:00:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 21:00:44] [INFO ] Invariant cache hit.
[2024-05-21 21:00:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 21:00:51] [INFO ] Implicit Places using invariants and state equation in 6591 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7085 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 239 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7678 ms. Remains : 184/186 places, 2108/2108 transitions.
[2024-05-21 21:00:51] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2024-05-21 21:00:51] [INFO ] Computed 5 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1424 resets) in 6115 ms. (163 steps per ms)
BEST_FIRST walk for 2000002 steps (1081 resets) in 4230 ms. (472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2024-05-21 21:01:01] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 21:01:01] [INFO ] Invariant cache hit.
[2024-05-21 21:01:01] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 21:01:02] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-05-21 21:01:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 21:01:02] [INFO ] [Real]Added 22 Read/Feed constraints in 26 ms returned sat
[2024-05-21 21:01:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:01:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 21:01:02] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-21 21:01:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 70 ms returned sat
[2024-05-21 21:01:02] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 81 ms.
[2024-05-21 21:01:02] [INFO ] Added : 10 causal constraints over 2 iterations in 370 ms. Result :sat
Minimization took 262 ms.
[2024-05-21 21:01:03] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 21:01:03] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-21 21:01:03] [INFO ] [Real]Added 22 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:01:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:01:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 21:01:03] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-21 21:01:03] [INFO ] [Nat]Added 22 Read/Feed constraints in 31 ms returned sat
[2024-05-21 21:01:03] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 46 ms.
[2024-05-21 21:01:03] [INFO ] Added : 8 causal constraints over 7 iterations in 397 ms. Result :sat
Minimization took 207 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 195 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 184/184 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 212 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-21 21:01:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 21:01:04] [INFO ] Invariant cache hit.
[2024-05-21 21:01:05] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-21 21:01:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 21:01:05] [INFO ] Invariant cache hit.
[2024-05-21 21:01:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 21:01:06] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
[2024-05-21 21:01:06] [INFO ] Redundant transitions in 89 ms returned []
Running 2105 sub problems to find dead transitions.
[2024-05-21 21:01:06] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 21:01:06] [INFO ] Invariant cache hit.
[2024-05-21 21:01:06] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 21:01:35] [INFO ] Deduced a trap composed of 5 places in 390 ms of which 3 ms to minimize.
[2024-05-21 21:01:53] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 77929ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 77951ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/184 places, 2028/2108 transitions.
Applied a total of 0 rules in 165 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 21:02:24] [INFO ] Redundant transitions in 44 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 79933 ms. Remains : 184/184 places, 2028/2108 transitions.
[2024-05-21 21:02:24] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-05-21 21:02:24] [INFO ] Computed 5 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1423 resets) in 5221 ms. (191 steps per ms)
BEST_FIRST walk for 2000002 steps (1082 resets) in 3780 ms. (528 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2024-05-21 21:02:33] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:02:33] [INFO ] Invariant cache hit.
[2024-05-21 21:02:33] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2024-05-21 21:02:33] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-05-21 21:02:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:02:33] [INFO ] [Real]Added 21 Read/Feed constraints in 45 ms returned sat
[2024-05-21 21:02:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:02:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 21:02:34] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-21 21:02:34] [INFO ] [Nat]Added 21 Read/Feed constraints in 35 ms returned sat
[2024-05-21 21:02:34] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 129 ms.
[2024-05-21 21:02:34] [INFO ] Added : 10 causal constraints over 2 iterations in 390 ms. Result :sat
Minimization took 234 ms.
[2024-05-21 21:02:34] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 21:02:35] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-21 21:02:35] [INFO ] [Real]Added 21 Read/Feed constraints in 24 ms returned sat
[2024-05-21 21:02:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:02:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 21:02:35] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-21 21:02:35] [INFO ] [Nat]Added 21 Read/Feed constraints in 33 ms returned sat
[2024-05-21 21:02:35] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 67 ms.
[2024-05-21 21:02:35] [INFO ] Added : 12 causal constraints over 10 iterations in 365 ms. Result :sat
Minimization took 312 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 168 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 184/184 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 217 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 21:02:37] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:02:37] [INFO ] Invariant cache hit.
[2024-05-21 21:02:37] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-21 21:02:37] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:02:37] [INFO ] Invariant cache hit.
[2024-05-21 21:02:37] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:02:38] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
[2024-05-21 21:02:38] [INFO ] Redundant transitions in 259 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:02:38] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:02:38] [INFO ] Invariant cache hit.
[2024-05-21 21:02:39] [INFO ] State equation strengthened by 21 read => feed constraints.

BK_STOP 1716325373454

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V80P50N10"
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-COL-V80P50N10, 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-171620398900141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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