Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620398700036.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BridgeAndVehicles-COL-V20P10N50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620398700036
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716320792457

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-21 19:46:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:46:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:46:33] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 19:46:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 19:46:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 530 ms
[2024-05-21 19:46:34] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 19:46:34] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-05-21 19:46:34] [INFO ] Skeletonized 10 HLPN properties in 2 ms. Removed 6 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Remains 2 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 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.1 ms
RANDOM walk for 298 steps (0 resets) in 30 ms. (9 steps per ms) remains 0/4 properties
[2024-05-21 19:46:34] [INFO ] Flatten gal took : 18 ms
[2024-05-21 19:46:34] [INFO ] Flatten gal took : 2 ms
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-05-21 19:46:34] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 100 ms.
[2024-05-21 19:46:34] [INFO ] Unfolded 14 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 106 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 38 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 19:46:35] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 19:46:35] [INFO ] Computed 5 invariants in 20 ms
[2024-05-21 19:46:35] [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-05-21 19:46:59] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 11 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 20129 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-05-21 19:47:29] [INFO ] Deduced a trap composed of 55 places in 212 ms of which 2 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1545 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 7 constraints, problems are : Problem set: 8 solved, 2217 unsolved in 20062 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 57422ms problems are : Problem set: 8 solved, 2217 unsolved
Search for dead transitions found 8 dead transitions in 57489ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 8 transitions.
[2024-05-21 19:47:32] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 19:47:32] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 19:47:32] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 19:47:32] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:47:32] [INFO ] Invariant cache hit.
[2024-05-21 19:47:33] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:47:33] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2220/2228 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57775 ms. Remains : 106/108 places, 2220/2228 transitions.
Support contains 106 out of 106 places after structural reductions.
[2024-05-21 19:47:33] [INFO ] Flatten gal took : 448 ms
[2024-05-21 19:47:35] [INFO ] Flatten gal took : 249 ms
[2024-05-21 19:47:36] [INFO ] Input system was already deterministic with 2220 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (228 resets) in 5352 ms. (7 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40002 steps (108 resets) in 320 ms. (124 steps per ms) remains 1/1 properties
[2024-05-21 19:47:37] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:47:37] [INFO ] Invariant cache hit.
[2024-05-21 19:47:37] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/303 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/394 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 102/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/396 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/396 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 102/102 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/303 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/394 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 102/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/396 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1159ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 251 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2220/2220 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2219
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2219
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2218
Applied a total of 5 rules in 351 ms. Remains 103 /106 variables (removed 3) and now considering 2218/2220 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 103/106 places, 2218/2220 transitions.
RANDOM walk for 40000 steps (316 resets) in 821 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (164 resets) in 327 ms. (121 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 415849 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 1
Probabilistic random walk after 415849 steps, saw 116662 distinct states, run finished after 3004 ms. (steps per millisecond=138 ) properties seen :0
[2024-05-21 19:47:42] [INFO ] Flow matrix only has 288 transitions (discarded 1930 similar events)
// Phase 1: matrix 288 rows 103 cols
[2024-05-21 19:47:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 19:47:42] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/303 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/389 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 102/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/391 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/391 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 102/102 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/303 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/389 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 102/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/391 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 897ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2218/2218 transitions.
Applied a total of 0 rules in 185 ms. Remains 103 /103 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 103/103 places, 2218/2218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2218/2218 transitions.
Applied a total of 0 rules in 277 ms. Remains 103 /103 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
[2024-05-21 19:47:44] [INFO ] Flow matrix only has 288 transitions (discarded 1930 similar events)
[2024-05-21 19:47:44] [INFO ] Invariant cache hit.
[2024-05-21 19:47:44] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-21 19:47:44] [INFO ] Flow matrix only has 288 transitions (discarded 1930 similar events)
[2024-05-21 19:47:44] [INFO ] Invariant cache hit.
[2024-05-21 19:47:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:47:45] [INFO ] Implicit Places using invariants and state equation in 858 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1168 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/103 places, 2218/2218 transitions.
Applied a total of 0 rules in 195 ms. Remains 101 /101 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1642 ms. Remains : 101/103 places, 2218/2218 transitions.
RANDOM walk for 40000 steps (316 resets) in 744 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (164 resets) in 292 ms. (136 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 387326 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 387326 steps, saw 109003 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2024-05-21 19:47:48] [INFO ] Flow matrix only has 288 transitions (discarded 1930 similar events)
// Phase 1: matrix 288 rows 101 cols
[2024-05-21 19:47:48] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 19:47:49] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/303 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/387 variables, 42/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 102/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/389 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 102/102 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/303 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/387 variables, 42/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 102/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/389 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/389 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 993ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 307 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2218/2218 transitions.
Applied a total of 0 rules in 193 ms. Remains 101 /101 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 101/101 places, 2218/2218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2218/2218 transitions.
Applied a total of 0 rules in 323 ms. Remains 101 /101 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
[2024-05-21 19:47:50] [INFO ] Flow matrix only has 288 transitions (discarded 1930 similar events)
[2024-05-21 19:47:50] [INFO ] Invariant cache hit.
[2024-05-21 19:47:51] [INFO ] Implicit Places using invariants in 675 ms returned []
[2024-05-21 19:47:51] [INFO ] Flow matrix only has 288 transitions (discarded 1930 similar events)
[2024-05-21 19:47:51] [INFO ] Invariant cache hit.
[2024-05-21 19:47:51] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:47:52] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2024-05-21 19:47:52] [INFO ] Redundant transitions in 113 ms returned []
Running 2215 sub problems to find dead transitions.
[2024-05-21 19:47:52] [INFO ] Flow matrix only has 288 transitions (discarded 1930 similar events)
[2024-05-21 19:47:52] [INFO ] Invariant cache hit.
[2024-05-21 19:47:52] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
[2024-05-21 19:48:16] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
[2024-05-21 19:48:18] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2127 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/389 variables, and 6 constraints, problems are : Problem set: 32 solved, 2183 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2215/2215 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 32 solved, 2183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 32 solved, 2183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/6 constraints. Problems are: Problem set: 32 solved, 2183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 32 solved, 2183 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 3 (OVERLAPS) 288/389 variables, 101/107 constraints. Problems are: Problem set: 34 solved, 2181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 102/209 constraints. Problems are: Problem set: 34 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 2390 constraints, problems are : Problem set: 34 solved, 2181 unsolved in 34455 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2181/2215 constraints, Known Traps: 2/2 constraints]
After SMT, in 83615ms problems are : Problem set: 34 solved, 2181 unsolved
Search for dead transitions found 34 dead transitions in 83639ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/101 places, 2184/2218 transitions.
Applied a total of 0 rules in 160 ms. Remains 101 /101 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-05-21 19:49:16] [INFO ] Redundant transitions in 122 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 85987 ms. Remains : 101/101 places, 2184/2218 transitions.
Computed a total of 49 stabilizing places and 84 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 74 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2220/2220 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 2 place count 105 transition count 2219
Applied a total of 2 rules in 750 ms. Remains 105 /106 variables (removed 1) and now considering 2219/2220 (removed 1) transitions.
Running 2216 sub problems to find dead transitions.
[2024-05-21 19:49:17] [INFO ] Flow matrix only has 289 transitions (discarded 1930 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-05-21 19:49:17] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 19:49:17] [INFO ] State equation strengthened by 102 read => feed constraints.

BK_STOP 1716320965004

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-V20P10N50"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V20P10N50, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620398700036"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;