Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620398700039.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 ltsminxred
Input is BridgeAndVehicles-COL-V20P10N50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398700039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.9K Apr 13 02:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 13 02:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 02:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 02:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 03:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 13 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:29 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 41K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717217867690

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:57:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:57:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:57:49] [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-06-01 04:57:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:57:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 742 ms
[2024-06-01 04:57:50] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:50] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-06-01 04:57:50] [INFO ] Skeletonized 14 HLPN properties in 0 ms.
Remains 3 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 712 steps (0 resets) in 53 ms. (13 steps per ms) remains 0/2 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 04:57:50] [INFO ] Flatten gal took : 16 ms
[2024-06-01 04:57:50] [INFO ] Flatten gal took : 4 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
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 [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 04:57:50] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 78 ms.
[2024-06-01 04:57:50] [INFO ] Unfolded 14 HLPN properties in 3 ms.
RANDOM walk for 40000 steps (228 resets) in 2938 ms. (13 steps per ms) remains 3/14 properties
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (108 resets) in 466 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (65 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (64 resets) in 7558 ms. (5 steps per ms) remains 3/3 properties
[2024-06-01 04:57:53] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-06-01 04:57:53] [INFO ] Computed 7 invariants in 18 ms
[2024-06-01 04:57:53] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 5/108 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 290/398 variables, 108/115 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 102/217 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 217 constraints, problems are : Problem set: 1 solved, 2 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 60/87 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 290/377 variables, 87/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 102/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 21/398 variables, 21/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 1/217 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 2/219 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/398 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 219 constraints, problems are : Problem set: 1 solved, 2 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4838ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 476 ms.
Support contains 27 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 882 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 292 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-06-01 04:57:59] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-06-01 04:57:59] [INFO ] Computed 5 invariants in 13 ms
[2024-06-01 04:57:59] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 04:58:30] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 04:58:54] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 3 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1392 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 7 constraints, problems are : Problem set: 5 solved, 2220 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 58371ms problems are : Problem set: 5 solved, 2220 unsolved
Search for dead transitions found 5 dead transitions in 58405ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/108 places, 2223/2228 transitions.
Applied a total of 0 rules in 210 ms. Remains 106 /106 variables (removed 0) and now considering 2223/2223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58944 ms. Remains : 106/108 places, 2223/2228 transitions.
RANDOM walk for 40000 steps (228 resets) in 676 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (108 resets) in 372 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (68 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 222578 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 2
Probabilistic random walk after 222578 steps, saw 59047 distinct states, run finished after 3005 ms. (steps per millisecond=74 ) properties seen :0
[2024-06-01 04:59:01] [INFO ] Flow matrix only has 290 transitions (discarded 1933 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-06-01 04:59:01] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 04:59:01] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 55/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 269/351 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/395 variables, 23/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 51/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/396 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/396 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 55/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 269/351 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 04:59:02] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 44/395 variables, 23/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 51/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/396 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/396 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1564 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2257ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 381 ms.
Support contains 27 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2223/2223 transitions.
Applied a total of 0 rules in 229 ms. Remains 106 /106 variables (removed 0) and now considering 2223/2223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 106/106 places, 2223/2223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2223/2223 transitions.
Applied a total of 0 rules in 304 ms. Remains 106 /106 variables (removed 0) and now considering 2223/2223 (removed 0) transitions.
[2024-06-01 04:59:04] [INFO ] Flow matrix only has 290 transitions (discarded 1933 similar events)
[2024-06-01 04:59:04] [INFO ] Invariant cache hit.
[2024-06-01 04:59:04] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-06-01 04:59:04] [INFO ] Flow matrix only has 290 transitions (discarded 1933 similar events)
[2024-06-01 04:59:04] [INFO ] Invariant cache hit.
[2024-06-01 04:59:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 04:59:05] [INFO ] Implicit Places using invariants and state equation in 598 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 925 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/106 places, 2223/2223 transitions.
Applied a total of 0 rules in 213 ms. Remains 104 /104 variables (removed 0) and now considering 2223/2223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1443 ms. Remains : 104/106 places, 2223/2223 transitions.
RANDOM walk for 40001 steps (228 resets) in 609 ms. (65 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (108 resets) in 347 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (67 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 251971 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 2
Probabilistic random walk after 251971 steps, saw 66358 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2024-06-01 04:59:09] [INFO ] Flow matrix only has 290 transitions (discarded 1933 similar events)
// Phase 1: matrix 290 rows 104 cols
[2024-06-01 04:59:09] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 04:59:09] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 55/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 269/351 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/393 variables, 21/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 51/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/394 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/394 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 55/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 269/351 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/393 variables, 21/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 51/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/394 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/394 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 791 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1438ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 875 ms.
Support contains 27 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2223/2223 transitions.
Applied a total of 0 rules in 206 ms. Remains 104 /104 variables (removed 0) and now considering 2223/2223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 104/104 places, 2223/2223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2223/2223 transitions.
Applied a total of 0 rules in 221 ms. Remains 104 /104 variables (removed 0) and now considering 2223/2223 (removed 0) transitions.
[2024-06-01 04:59:11] [INFO ] Flow matrix only has 290 transitions (discarded 1933 similar events)
[2024-06-01 04:59:11] [INFO ] Invariant cache hit.
[2024-06-01 04:59:12] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-06-01 04:59:12] [INFO ] Flow matrix only has 290 transitions (discarded 1933 similar events)
[2024-06-01 04:59:12] [INFO ] Invariant cache hit.
[2024-06-01 04:59:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 04:59:13] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
[2024-06-01 04:59:13] [INFO ] Redundant transitions in 165 ms returned []
Running 2220 sub problems to find dead transitions.
[2024-06-01 04:59:13] [INFO ] Flow matrix only has 290 transitions (discarded 1933 similar events)
[2024-06-01 04:59:13] [INFO ] Invariant cache hit.
[2024-06-01 04:59:13] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-06-01 04:59:37] [INFO ] Deduced a trap composed of 5 places in 417 ms of which 39 ms to minimize.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-00
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-01
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-02
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-03
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-04
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-05
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-06
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-07
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-08
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-09
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-10
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-11
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-12
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-13
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-14
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-15

BK_STOP 1717217987764

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/584/inv_0_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/584/inv_1_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/584/inv_2_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/584/inv_3_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/584/inv_4_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/584/inv_5_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/584/inv_6_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/584/inv_7_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/584/inv_8_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/584/inv_9_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/584/inv_10_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/584/inv_11_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/584/inv_12_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/584/inv_13_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/584/inv_14_
rfs formula name BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/584/inv_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-V20P10N50"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BridgeAndVehicles-COL-V20P10N50, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620398700039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P10N50.tgz
mv BridgeAndVehicles-COL-V20P10N50 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;