About the Execution of LTSMin+red for BridgeAndVehicles-COL-V80P50N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15437.556 | 236546.00 | 321734.00 | 82.20 | T?TFTTFTTFTF?TTT | normal |
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-171620398900142.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-V80P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398900142
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Apr 13 01:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 01:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 00:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 00:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 01:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 13 01:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 13 01:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 45K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717219332234
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:22:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:22:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:22:13] [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 05:22:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:22:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 531 ms
[2024-06-01 05:22:14] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:22:14] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 3 ms.
[2024-06-01 05:22:14] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Remains 16 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
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 1554 ms. (25 steps per ms) remains 8/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 271 ms. (147 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 532 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 05:22:15] [INFO ] Computed 4 invariants in 4 ms
Problem BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-00 is UNSAT
Problem BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-06 is UNSAT
Problem BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-09 is UNSAT
Problem BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-13 is UNSAT
Problem BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-15 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 5 solved, 3 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 3/4 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 3/19 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 19 constraints, problems are : Problem set: 5 solved, 3 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 311ms problems are : Problem set: 5 solved, 3 unsolved
Finished Parikh walk after 19028 steps, including 74 resets, run visited all 3 properties in 33 ms. (steps per millisecond=576 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 39 ms.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 05:22:15] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:22:15] [INFO ] Flatten gal took : 1 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 )
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-04 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-05 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-13 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 05:22:15] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 100 ms.
[2024-06-01 05:22:15] [INFO ] Unfolded 16 HLPN properties in 1 ms.
RANDOM walk for 40000 steps (56 resets) in 1638 ms. (24 steps per ms) remains 3/9 properties
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (20 resets) in 223 ms. (178 steps per ms) remains 2/3 properties
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (20 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
[2024-06-01 05:22:16] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-06-01 05:22:16] [INFO ] Computed 7 invariants in 16 ms
[2024-06-01 05:22:16] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 370/385 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 173/558 variables, 173/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/558 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 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/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:22:17] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 370/385 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 173/558 variables, 173/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/558 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 220 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1524ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1332 ms.
Support contains 10 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 268 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-06-01 05:22:19] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 05:22:19] [INFO ] Invariant cache hit.
[2024-06-01 05:22:19] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-06-01 05:22:45] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/558 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 49)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s83 1)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/558 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 54883ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 54916ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55203 ms. Remains : 188/188 places, 2108/2108 transitions.
RANDOM walk for 40000 steps (56 resets) in 935 ms. (42 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (20 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (20 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 232642 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 2
Probabilistic random walk after 232642 steps, saw 64454 distinct states, run finished after 3010 ms. (steps per millisecond=77 ) properties seen :0
[2024-06-01 05:23:18] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 05:23:18] [INFO ] Invariant cache hit.
[2024-06-01 05:23:18] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 370/385 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 173/558 variables, 173/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/558 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 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/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:23:18] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 370/385 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 173/558 variables, 173/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/558 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 220 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1793 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2300ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1416 ms.
Support contains 10 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 159 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 188/188 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 217 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-06-01 05:23:22] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 05:23:22] [INFO ] Invariant cache hit.
[2024-06-01 05:23:22] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-06-01 05:23:22] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 05:23:22] [INFO ] Invariant cache hit.
[2024-06-01 05:23:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 05:23:24] [INFO ] Implicit Places using invariants and state equation in 2316 ms returned []
Implicit Place search using SMT with State Equation took 2648 ms to find 0 implicit places.
[2024-06-01 05:23:25] [INFO ] Redundant transitions in 252 ms returned []
Running 2105 sub problems to find dead transitions.
[2024-06-01 05:23:25] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 05:23:25] [INFO ] Invariant cache hit.
[2024-06-01 05:23:25] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-06-01 05:23:52] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 1 ms to minimize.
[2024-06-01 05:24:09] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 0 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/558 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/558 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 77218ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 77253ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 188/188 places, 2028/2108 transitions.
Applied a total of 0 rules in 162 ms. Remains 188 /188 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 05:24:42] [INFO ] Redundant transitions in 46 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 80609 ms. Remains : 188/188 places, 2028/2108 transitions.
RANDOM walk for 40000 steps (56 resets) in 819 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40005 steps (20 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (20 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 234263 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 234263 steps, saw 64860 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-01 05:24:46] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 188 cols
[2024-06-01 05:24:46] [INFO ] Computed 7 invariants in 18 ms
[2024-06-01 05:24:46] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 369/384 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 173/557 variables, 173/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/557 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 21/21 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/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:24:46] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 369/384 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 173/557 variables, 173/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/557 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1185 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1682ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 954 ms.
Support contains 10 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Applied a total of 0 rules in 131 ms. Remains 188 /188 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 188/188 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Applied a total of 0 rules in 135 ms. Remains 188 /188 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 05:24:49] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:24:49] [INFO ] Invariant cache hit.
[2024-06-01 05:24:49] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-06-01 05:24:49] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:24:49] [INFO ] Invariant cache hit.
[2024-06-01 05:24:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:24:50] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
[2024-06-01 05:24:50] [INFO ] Redundant transitions in 36 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-06-01 05:24:50] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:24:50] [INFO ] Invariant cache hit.
[2024-06-01 05:24:50] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 05:25:16] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/557 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/557 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 76568ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 76596ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78160 ms. Remains : 188/188 places, 2028/2028 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1659 transitions
Reduce isomorphic transitions removed 1659 transitions.
Iterating post reduction 0 with 1659 rules applied. Total rules applied 1659 place count 188 transition count 369
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 1660 place count 188 transition count 369
Applied a total of 1660 rules in 23 ms. Remains 188 /188 variables (removed 0) and now considering 369/2028 (removed 1659) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 369 rows 188 cols
[2024-06-01 05:26:07] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 05:26:07] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 05:26:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 05:26:07] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 05:26:07] [INFO ] After 462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 05:26:07] [INFO ] After 683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 802 ms.
[2024-06-01 05:26:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2024-06-01 05:26:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 2028 transitions and 15310 arcs took 28 ms.
[2024-06-01 05:26:08] [INFO ] Flatten gal took : 413 ms
Total runtime 234827 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-01
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-12
BK_STOP 1717219568780
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/636/inv_0_
rfs formula name BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/636/inv_1_
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-V80P50N10"
export BK_EXAMINATION="ReachabilityCardinality"
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-V80P50N10, examination is ReachabilityCardinality"
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-171620398900142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N10.tgz
mv BridgeAndVehicles-COL-V80P50N10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;