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-171620398600031.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-V20P10N20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398600031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.3K Apr 13 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 02:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 02:09 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.2K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 02:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 13 02:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 40K 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-V20P10N20-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717217844270

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-V20P10N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:57:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:57:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:57:25] [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:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:57:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 604 ms
[2024-06-01 04:57:26] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 78 PT places and 37258.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Reduction of identical properties reduced properties to check from 16 to 12
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:26] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 6 ms.
[2024-06-01 04:57:26] [INFO ] Skeletonized 10 HLPN properties in 1 ms.
All 10 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] 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:26] [INFO ] Unfolded HLPN to a Petri net with 78 places and 968 transitions 7350 arcs in 79 ms.
[2024-06-01 04:57:26] [INFO ] Unfolded 10 HLPN properties in 2 ms.
RANDOM walk for 40000 steps (228 resets) in 5415 ms. (7 steps per ms) remains 5/10 properties
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (89 resets) in 3024 ms. (13 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (76 resets) in 811 ms. (49 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (76 resets) in 7001 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (108 resets) in 2638 ms. (15 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (104 resets) in 3563 ms. (11 steps per ms) remains 5/5 properties
[2024-06-01 04:57:33] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2024-06-01 04:57:33] [INFO ] Computed 7 invariants in 15 ms
[2024-06-01 04:57:33] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-10 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 170/248 variables, 78/85 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 42/127 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/127 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/248 variables, 0/127 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 127 constraints, problems are : Problem set: 4 solved, 1 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/78 variables, 4/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 170/248 variables, 78/85 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 42/127 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 1/128 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/128 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/248 variables, 0/128 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 128 constraints, problems are : Problem set: 4 solved, 1 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3960ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 161 ms.
Support contains 71 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 642 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 146 ms. Remains 76 /78 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 965 sub problems to find dead transitions.
[2024-06-01 04:57:37] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2024-06-01 04:57:37] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 04:57:37] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 965 unsolved
[2024-06-01 04:57:43] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 8 ms to minimize.
[2024-06-01 04:57:45] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
Problem TDEAD528 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD927 is UNSAT
[2024-06-01 04:57:47] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 3 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 3 (OVERLAPS) 170/246 variables, 76/84 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 42/126 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/126 constraints. Problems are: Problem set: 42 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 246/246 variables, and 126 constraints, problems are : Problem set: 42 solved, 923 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 76/76 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 965/965 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 170/246 variables, 76/84 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 42/126 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 923/1049 constraints. Problems are: Problem set: 42 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 1049 constraints, problems are : Problem set: 42 solved, 923 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 76/76 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 923/965 constraints, Known Traps: 3/3 constraints]
After SMT, in 43418ms problems are : Problem set: 42 solved, 923 unsolved
Search for dead transitions found 42 dead transitions in 43437ms
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 : 76/78 places, 926/968 transitions.
Applied a total of 0 rules in 52 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43661 ms. Remains : 76/78 places, 926/968 transitions.
RANDOM walk for 40001 steps (228 resets) in 391 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (76 resets) in 346 ms. (115 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 646231 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 1
Probabilistic random walk after 646231 steps, saw 159931 distinct states, run finished after 3005 ms. (steps per millisecond=215 ) properties seen :0
[2024-06-01 04:58:24] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 76 cols
[2024-06-01 04:58:24] [INFO ] Computed 7 invariants in 5 ms
[2024-06-01 04:58:24] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/75 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 166/242 variables, 76/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/75 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 166/242 variables, 76/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/242 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 875ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 71 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 926/926 transitions.
Applied a total of 0 rules in 48 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 76/76 places, 926/926 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 926/926 transitions.
Applied a total of 0 rules in 43 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
[2024-06-01 04:58:25] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 04:58:25] [INFO ] Invariant cache hit.
[2024-06-01 04:58:25] [INFO ] Implicit Places using invariants in 110 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 122 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 74/76 places, 926/926 transitions.
Applied a total of 0 rules in 43 ms. Remains 74 /74 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 209 ms. Remains : 74/76 places, 926/926 transitions.
RANDOM walk for 40001 steps (228 resets) in 504 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (76 resets) in 588 ms. (67 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 602625 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 1
Probabilistic random walk after 602625 steps, saw 149831 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2024-06-01 04:58:28] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 74 cols
[2024-06-01 04:58:28] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 04:58:29] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 166/240 variables, 74/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 74/74 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 166/240 variables, 74/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 04:58:29] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/240 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 74/74 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1098ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 71 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 926/926 transitions.
Applied a total of 0 rules in 52 ms. Remains 74 /74 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 74/74 places, 926/926 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 926/926 transitions.
Applied a total of 0 rules in 48 ms. Remains 74 /74 variables (removed 0) and now considering 926/926 (removed 0) transitions.
[2024-06-01 04:58:30] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 04:58:30] [INFO ] Invariant cache hit.
[2024-06-01 04:58:30] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 04:58:30] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 04:58:30] [INFO ] Invariant cache hit.
[2024-06-01 04:58:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 04:58:30] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-06-01 04:58:30] [INFO ] Redundant transitions in 55 ms returned []
Running 923 sub problems to find dead transitions.
[2024-06-01 04:58:30] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 04:58:30] [INFO ] Invariant cache hit.
[2024-06-01 04:58:30] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 04:58:35] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 166/240 variables, 74/80 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 923 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 120 constraints, problems are : Problem set: 0 solved, 923 unsolved in 26463 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 74/74 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 166/240 variables, 74/80 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 923/1043 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1043 constraints, problems are : Problem set: 0 solved, 923 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 74/74 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 1/1 constraints]
After SMT, in 59658ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 59674ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60004 ms. Remains : 74/74 places, 926/926 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 760 transitions
Reduce isomorphic transitions removed 760 transitions.
Iterating post reduction 0 with 760 rules applied. Total rules applied 760 place count 74 transition count 166
Applied a total of 760 rules in 21 ms. Remains 74 /74 variables (removed 0) and now considering 166/926 (removed 760) transitions.
Running SMT prover for 1 properties.
[2024-06-01 04:59:30] [INFO ] Invariant cache hit.
[2024-06-01 04:59:30] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:59:30] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 04:59:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:59:30] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 04:59:30] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 04:59:30] [INFO ] After 540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 651 ms.
[2024-06-01 04:59:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-06-01 04:59:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 74 places, 926 transitions and 6940 arcs took 12 ms.
[2024-06-01 04:59:31] [INFO ] Flatten gal took : 128 ms
Total runtime 125550 ms.
There are residual formulas that ITS could not solve within timeout
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-V20P10N20-ReachabilityFireability-2024-06

BK_STOP 1717217971444

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-V20P10N20-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/603/inv_0_
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-V20P10N20"
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-V20P10N20, 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-171620398600031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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