Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r027-smll-174853774200026.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is BridgeAndVehicles-COL-V20P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774200026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 39K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748544749214

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-05-29 18:52:31] [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]
[2025-05-29 18:52:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:52:31] [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.
[2025-05-29 18:52:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-29 18:52:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1480 ms
[2025-05-29 18:52:33] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 40 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 8
[2025-05-29 18:52:33] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 6 ms.
[2025-05-29 18:52:33] [INFO ] Skeletonized 8 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
[2025-05-29 18:52:33] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[20, 0, 0, 1, 0, 0, 20, 1] Max Struct:[20, 1, 20, 1, 20, 20, 20, 1]
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-13 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-05-29 18:52:33] [INFO ] Invariant cache hit.
[2025-05-29 18:52:33] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-29 18:52:33] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-05-29 18:52:33] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 29 ms.
[2025-05-29 18:52:33] [INFO ] Added : 1 causal constraints over 1 iterations in 77 ms. Result :sat
Minimization took 49 ms.
[2025-05-29 18:52:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 18:52:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 29 ms returned sat
[2025-05-29 18:52:34] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2025-05-29 18:52:34] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-29 18:52:34] [INFO ] Added : 1 causal constraints over 1 iterations in 94 ms. Result :sat
Minimization took 23 ms.
[2025-05-29 18:52:34] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-05-29 18:52:34] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-05-29 18:52:34] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-29 18:52:34] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Minimization took 5 ms.
[2025-05-29 18:52:34] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 18:52:34] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-29 18:52:34] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-29 18:52:34] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 12 ms.
[2025-05-29 18:52:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-29 18:52:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-05-29 18:52:34] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-29 18:52:34] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 20, 20, 20]
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] 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
[2025-05-29 18:52:34] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions 4070 arcs in 90 ms.
[2025-05-29 18:52:34] [INFO ] Unfolded 4 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 20, 20, 20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 20, 20, 20]
[2025-05-29 18:52:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2025-05-29 18:52:34] [INFO ] Computed 7 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 20, 20, 20]
RANDOM walk for 10000 steps (56 resets) in 122 ms. (81 steps per ms)
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (20 resets) in 43 ms. (227 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[20]
[2025-05-29 18:52:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2025-05-29 18:52:34] [INFO ] Invariant cache hit.
[2025-05-29 18:52:35] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 18:52:35] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2025-05-29 18:52:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 18:52:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 18:52:35] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-05-29 18:52:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 18:52:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 17 ms returned sat
[2025-05-29 18:52:35] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 67 ms.
[2025-05-29 18:52:35] [INFO ] Added : 11 causal constraints over 3 iterations in 131 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[20]
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 123 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
Running 544 sub problems to find dead transitions.
[2025-05-29 18:52:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2025-05-29 18:52:35] [INFO ] Computed 5 invariants in 7 ms
[2025-05-29 18:52:35] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2025-05-29 18:52:40] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 12 ms to minimize.
[2025-05-29 18:52:41] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 3 ms to minimize.
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 524 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/72 constraints. Problems are: Problem set: 22 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/94 constraints. Problems are: Problem set: 22 solved, 522 unsolved
[2025-05-29 18:52:48] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 13 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 1/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 194/194 variables, and 95 constraints, problems are : Problem set: 42 solved, 502 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/73 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 502/597 constraints. Problems are: Problem set: 42 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/194 variables, and 597 constraints, problems are : Problem set: 42 solved, 502 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 502/544 constraints, Known Traps: 3/3 constraints]
After SMT, in 42050ms problems are : Problem set: 42 solved, 502 unsolved
Search for dead transitions found 42 dead transitions in 42105ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/68 places, 505/548 transitions.
Applied a total of 0 rules in 38 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42300 ms. Remains : 65/68 places, 505/548 transitions.
[2025-05-29 18:53:17] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2025-05-29 18:53:17] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[20]
RANDOM walk for 1000000 steps (6490 resets) in 3880 ms. (257 steps per ms)
BEST_FIRST walk for 1000000 steps (2551 resets) in 1406 ms. (710 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 18:53:23] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 18:53:23] [INFO ] Invariant cache hit.
[2025-05-29 18:53:23] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-29 18:53:23] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 18:53:23] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-29 18:53:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 18:53:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-29 18:53:23] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-29 18:53:23] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-05-29 18:53:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 18:53:23] [INFO ] [Nat]Added 20 Read/Feed constraints in 13 ms returned sat
[2025-05-29 18:53:23] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 34 ms.
[2025-05-29 18:53:23] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:53:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2025-05-29 18:53:23] [INFO ] Added : 10 causal constraints over 2 iterations in 232 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 27 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 65/65 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 23 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-05-29 18:53:23] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 18:53:23] [INFO ] Invariant cache hit.
[2025-05-29 18:53:24] [INFO ] Implicit Places using invariants in 392 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 416 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/65 places, 505/505 transitions.
Applied a total of 0 rules in 69 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 509 ms. Remains : 63/65 places, 505/505 transitions.
[2025-05-29 18:53:24] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 63 cols
[2025-05-29 18:53:24] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (6489 resets) in 2939 ms. (340 steps per ms)
BEST_FIRST walk for 1000001 steps (2550 resets) in 1206 ms. (828 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 18:53:28] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 18:53:28] [INFO ] Invariant cache hit.
[2025-05-29 18:53:28] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 18:53:28] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-05-29 18:53:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 18:53:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 18:53:28] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-05-29 18:53:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 18:53:28] [INFO ] [Nat]Added 20 Read/Feed constraints in 8 ms returned sat
[2025-05-29 18:53:28] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:53:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2025-05-29 18:53:28] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 29 ms.
[2025-05-29 18:53:28] [INFO ] Added : 11 causal constraints over 3 iterations in 102 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 33 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 63/63 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 27 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-05-29 18:53:29] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 18:53:29] [INFO ] Invariant cache hit.
[2025-05-29 18:53:29] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-05-29 18:53:29] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 18:53:29] [INFO ] Invariant cache hit.
[2025-05-29 18:53:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 18:53:29] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2025-05-29 18:53:29] [INFO ] Redundant transitions in 52 ms returned []
Running 502 sub problems to find dead transitions.
[2025-05-29 18:53:29] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 18:53:29] [INFO ] Invariant cache hit.
[2025-05-29 18:53:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 18:53:33] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 18:53:43] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2025-05-29 18:53:43] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 91 constraints, problems are : Problem set: 0 solved, 502 unsolved in 24447 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/71 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/593 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 593 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 55753ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 55766ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56529 ms. Remains : 63/63 places, 505/505 transitions.
RANDOM walk for 40000 steps (256 resets) in 1803 ms. (22 steps per ms) remains 2/2 properties
[2025-05-29 18:54:26] [INFO ] Flatten gal took : 348 ms
BEST_FIRST walk for 40001 steps (102 resets) in 346 ms. (115 steps per ms) remains 2/2 properties
[2025-05-29 18:54:26] [INFO ] Flatten gal took : 137 ms
BEST_FIRST walk for 40002 steps (100 resets) in 311 ms. (128 steps per ms) remains 2/2 properties
[2025-05-29 18:54:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1588877666458217864.gal : 35 ms
[2025-05-29 18:54:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5855468886917312520.prop : 2 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/ReachabilityCardinality1588877666458217864.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5855468886917312520.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/ReachabilityCardinality5855468886917312520.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 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 38
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :38 after 107
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :107 after 234
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :234 after 563
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :563 after 1757
Interrupted probabilistic random walk after 342081 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 2
Probabilistic random walk after 342081 steps, saw 88190 distinct states, run finished after 3006 ms. (steps per millisecond=113 ) properties seen :0
[2025-05-29 18:54:29] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 18:54:29] [INFO ] Invariant cache hit.
[2025-05-29 18:54:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/92 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4992 after 5154
[2025-05-29 18:54:29] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/146 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 18:54:29] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 41/187 variables, 21/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/188 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/92 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/146 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/146 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 41/187 variables, 21/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/187 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/188 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 92 constraints, problems are : Problem set: 0 solved, 2 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 897ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 228 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2025-05-29 18:54:30] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 18:54:30] [INFO ] Invariant cache hit.
[2025-05-29 18:54:30] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5154 after 5493
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5493 after 5765
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 18:54:33] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 18:54:41] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2025-05-29 18:54:41] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 502 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5765 after 12763
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 91 constraints, problems are : Problem set: 0 solved, 502 unsolved in 18837 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/71 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/593 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 593 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 39950ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 39958ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39990 ms. Remains : 63/63 places, 505/505 transitions.
RANDOM walk for 40001 steps (257 resets) in 633 ms. (63 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (99 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40010 steps (99 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 337240 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 2
Probabilistic random walk after 337240 steps, saw 87186 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2025-05-29 18:55:14] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 18:55:14] [INFO ] Invariant cache hit.
[2025-05-29 18:55:14] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/92 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 18:55:14] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/146 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 18:55:14] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 41/187 variables, 21/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/188 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/92 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/146 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/146 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 41/187 variables, 21/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/187 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/188 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 92 constraints, problems are : Problem set: 0 solved, 2 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 941ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 302 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 63/63 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 15 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-05-29 18:55:15] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 18:55:15] [INFO ] Invariant cache hit.
[2025-05-29 18:55:15] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-05-29 18:55:15] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 18:55:15] [INFO ] Invariant cache hit.
[2025-05-29 18:55:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 18:55:15] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2025-05-29 18:55:15] [INFO ] Redundant transitions in 14 ms returned []
Running 502 sub problems to find dead transitions.
[2025-05-29 18:55:15] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 18:55:15] [INFO ] Invariant cache hit.
[2025-05-29 18:55:15] [INFO ] State equation strengthened by 20 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 18:55:16] [INFO ] Flatten gal took : 63 ms
[2025-05-29 18:55:16] [INFO ] Applying decomposition
[2025-05-29 18:55:16] [INFO ] Flatten gal took : 58 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/graph3703111538923179994.txt' '-o' '/tmp/graph3703111538923179994.bin' '-w' '/tmp/graph3703111538923179994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3703111538923179994.bin' '-l' '-1' '-v' '-w' '/tmp/graph3703111538923179994.weights' '-q' '0' '-e' '0.001'
[2025-05-29 18:55:17] [INFO ] Decomposing Gal with order
[2025-05-29 18:55:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 18:55:17] [INFO ] Removed a total of 874 redundant transitions.
[2025-05-29 18:55:17] [INFO ] Flatten gal took : 393 ms
[2025-05-29 18:55:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 31 ms.
[2025-05-29 18:55:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17514712033639263616.gal : 11 ms
[2025-05-29 18:55:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13222109912351969953.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/ReachabilityCardinality17514712033639263616.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13222109912351969953.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13222109912351969953.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :24 after 49
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :49 after 94
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :94 after 131
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :131 after 240
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :240 after 875
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :875 after 1802
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :13083 after 23652
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 18:55:18] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :65333 after 103976
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :944446 after 1.14958e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 18:55:26] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2025-05-29 18:55:26] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 502 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.48679e+06 after 3.59192e+06
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 91 constraints, problems are : Problem set: 0 solved, 502 unsolved in 18537 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/71 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/593 constraints. Problems are: Problem set: 0 solved, 502 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,4.05339e+06,29.5197,477664,975,5067,192360,317199,104,1.08426e+06,209,5.95704e+06,0
Total reachable state count : 4053390

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,29.5225,477664,1,0,192360,317199,104,1.08426e+06,210,5.95704e+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,29.5234,477664,1,0,192360,317199,106,1.08426e+06,211,5.95704e+06,0
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 593 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 50075ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 50083ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50563 ms. Remains : 63/63 places, 505/505 transitions.
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-12 10 TECHNIQUES REACHABILITY_MIN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-15 10 TECHNIQUES REACHABILITY_MIN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-07 10 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 214430 ms.

BK_STOP 1748544965998

--------------------
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-V20P20N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is BridgeAndVehicles-COL-V20P20N10, 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 r027-smll-174853774200026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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