Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760800295.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPt-PT-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760800295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 12 22:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 12 22:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 159K May 18 16:43 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 ShieldIIPt-PT-030A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717237396190

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:23:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:23:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:23:17] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-06-01 10:23:17] [INFO ] Transformed 573 places.
[2024-06-01 10:23:17] [INFO ] Transformed 423 transitions.
[2024-06-01 10:23:17] [INFO ] Found NUPN structural information;
[2024-06-01 10:23:17] [INFO ] Parsed PT model containing 573 places and 423 transitions and 1806 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 2001 ms. (19 steps per ms) remains 11/16 properties
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 453 ms. (88 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 266 ms. (149 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 560 ms. (71 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 218 ms. (182 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 11/11 properties
// Phase 1: matrix 422 rows 573 cols
[2024-06-01 10:23:19] [INFO ] Computed 271 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 134/291 variables, 137/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 134/428 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 282/573 variables, 134/562 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 282/844 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 422/995 variables, 573/1417 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/995 variables, 0/1417 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/995 variables, 0/1417 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 995/995 variables, and 1417 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1443 ms.
Refiners :[Domain max(s): 573/573 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 573/573 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 134/291 variables, 137/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 134/428 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 282/573 variables, 134/562 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 282/844 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 422/995 variables, 573/1417 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/995 variables, 11/1428 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/995 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/995 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 995/995 variables, and 1428 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2369 ms.
Refiners :[Domain max(s): 573/573 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 573/573 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 3944ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 21690 ms.
Support contains 157 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 422/422 transitions.
Partial Free-agglomeration rule applied 32 times.
Drop transitions (Partial Free agglomeration) removed 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 573 transition count 422
Applied a total of 32 rules in 86 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 573/573 places, 422/422 transitions.
RANDOM walk for 40000 steps (8 resets) in 1401 ms. (28 steps per ms) remains 9/11 properties
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 210 ms. (189 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
// Phase 1: matrix 422 rows 573 cols
[2024-06-01 10:23:46] [INFO ] Computed 271 invariants in 3 ms
[2024-06-01 10:23:46] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 125/260 variables, 122/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 125/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 313/573 variables, 149/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 313/844 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 422/995 variables, 573/1417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/995 variables, 11/1428 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/995 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/995 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 995/995 variables, and 1428 constraints, problems are : Problem set: 0 solved, 9 unsolved in 898 ms.
Refiners :[Domain max(s): 573/573 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 573/573 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 125/260 variables, 122/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 125/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 313/573 variables, 149/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 313/844 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 422/995 variables, 573/1417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/995 variables, 11/1428 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/995 variables, 9/1437 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/995 variables, 0/1437 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/995 variables, 0/1437 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 995/995 variables, and 1437 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1988 ms.
Refiners :[Domain max(s): 573/573 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 573/573 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2935ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 10987 ms.
Support contains 115 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 572 transition count 421
Applied a total of 9 rules in 59 ms. Remains 572 /573 variables (removed 1) and now considering 421/422 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 572/573 places, 421/422 transitions.
RANDOM walk for 40000 steps (8 resets) in 358 ms. (111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 241 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 414863 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :1 out of 2
Probabilistic random walk after 414863 steps, saw 404820 distinct states, run finished after 3004 ms. (steps per millisecond=138 ) properties seen :1
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 421 rows 572 cols
[2024-06-01 10:24:03] [INFO ] Computed 271 invariants in 6 ms
[2024-06-01 10:24:03] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/86 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 45/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 486/572 variables, 231/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 486/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 421/993 variables, 572/1415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/993 variables, 17/1432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/993 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/993 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 993/993 variables, and 1432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 447 ms.
Refiners :[Domain max(s): 572/572 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 572/572 constraints, ReadFeed: 17/17 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/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/86 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 45/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 486/572 variables, 231/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 486/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 421/993 variables, 572/1415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/993 variables, 17/1432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/993 variables, 1/1433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/993 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/993 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 993/993 variables, and 1433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 518 ms.
Refiners :[Domain max(s): 572/572 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 572/572 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 986ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 559 ms.
Support contains 41 out of 572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 421/421 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 572 transition count 420
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 571 transition count 420
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 571 transition count 420
Applied a total of 14 rules in 65 ms. Remains 571 /572 variables (removed 1) and now considering 420/421 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 571/572 places, 420/421 transitions.
RANDOM walk for 40000 steps (8 resets) in 1015 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 487633 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 487633 steps, saw 471122 distinct states, run finished after 3003 ms. (steps per millisecond=162 ) properties seen :0
// Phase 1: matrix 420 rows 571 cols
[2024-06-01 10:24:08] [INFO ] Computed 271 invariants in 6 ms
[2024-06-01 10:24:08] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/86 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 45/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 485/571 variables, 231/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 485/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 420/991 variables, 571/1413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/991 variables, 26/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/991 variables, 0/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/991 variables, 0/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 991/991 variables, and 1439 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Domain max(s): 571/571 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 571/571 constraints, ReadFeed: 26/26 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/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/86 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 45/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 485/571 variables, 231/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 485/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 420/991 variables, 571/1413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/991 variables, 26/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/991 variables, 1/1440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/991 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/991 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 991/991 variables, and 1440 constraints, problems are : Problem set: 0 solved, 1 unsolved in 496 ms.
Refiners :[Domain max(s): 571/571 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 571/571 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 825ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 626 ms.
Support contains 41 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 420/420 transitions.
Applied a total of 0 rules in 33 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 571/571 places, 420/420 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 420/420 transitions.
Applied a total of 0 rules in 17 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-06-01 10:24:09] [INFO ] Invariant cache hit.
[2024-06-01 10:24:10] [INFO ] Implicit Places using invariants in 346 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 357 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 569/571 places, 420/420 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 419
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 419
Applied a total of 2 rules in 21 ms. Remains 568 /569 variables (removed 1) and now considering 419/420 (removed 1) transitions.
// Phase 1: matrix 419 rows 568 cols
[2024-06-01 10:24:10] [INFO ] Computed 269 invariants in 6 ms
[2024-06-01 10:24:10] [INFO ] Implicit Places using invariants in 304 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 307 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 567/571 places, 419/420 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 566 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 566 transition count 418
Applied a total of 2 rules in 26 ms. Remains 566 /567 variables (removed 1) and now considering 418/419 (removed 1) transitions.
// Phase 1: matrix 418 rows 566 cols
[2024-06-01 10:24:10] [INFO ] Computed 268 invariants in 2 ms
[2024-06-01 10:24:10] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-06-01 10:24:10] [INFO ] Invariant cache hit.
[2024-06-01 10:24:11] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 10:24:11] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 566/571 places, 418/420 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1654 ms. Remains : 566/571 places, 418/420 transitions.
RANDOM walk for 40000 steps (8 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 481628 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 1
Probabilistic random walk after 481628 steps, saw 465316 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2024-06-01 10:24:14] [INFO ] Invariant cache hit.
[2024-06-01 10:24:14] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/86 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 480/566 variables, 228/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 418/984 variables, 566/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/984 variables, 23/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/984 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/984 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 984/984 variables, and 857 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 23/23 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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/86 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 480/566 variables, 228/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 418/984 variables, 566/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/984 variables, 23/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/984 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/984 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/984 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 984/984 variables, and 858 constraints, problems are : Problem set: 0 solved, 1 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 751ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 851 ms.
Support contains 41 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 418/418 transitions.
Applied a total of 0 rules in 28 ms. Remains 566 /566 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 566/566 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 418/418 transitions.
Applied a total of 0 rules in 23 ms. Remains 566 /566 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2024-06-01 10:24:16] [INFO ] Invariant cache hit.
[2024-06-01 10:24:16] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-06-01 10:24:16] [INFO ] Invariant cache hit.
[2024-06-01 10:24:16] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 10:24:17] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2024-06-01 10:24:17] [INFO ] Redundant transitions in 31 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-01 10:24:17] [INFO ] Invariant cache hit.
[2024-06-01 10:24:17] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (OVERLAPS) 1/566 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 418/984 variables, 566/834 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/984 variables, 23/857 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/984 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/984 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 984/984 variables, and 857 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (OVERLAPS) 1/566 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 418/984 variables, 566/834 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/984 variables, 23/857 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/984 variables, 417/1274 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/984 variables, 0/1274 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/984 variables, and 1274 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61189 ms. Remains : 566/566 places, 418/418 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 566 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 566 transition count 396
Applied a total of 44 rules in 38 ms. Remains 566 /566 variables (removed 0) and now considering 396/418 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 566 cols
[2024-06-01 10:25:17] [INFO ] Computed 268 invariants in 2 ms
[2024-06-01 10:25:17] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 10:25:17] [INFO ] [Nat]Absence check using 268 positive place invariants in 34 ms returned sat
[2024-06-01 10:25:18] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 10:25:18] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 10:25:18] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 607 ms.
[2024-06-01 10:25:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 14 ms.
[2024-06-01 10:25:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 566 places, 418 transitions and 1913 arcs took 6 ms.
[2024-06-01 10:25:18] [INFO ] Flatten gal took : 99 ms
Total runtime 121084 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 : ShieldIIPt-PT-030A-ReachabilityFireability-2024-11

BK_STOP 1717237518694

--------------------
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 ShieldIIPt-PT-030A-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/584/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="ShieldIIPt-PT-030A"
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 ShieldIIPt-PT-030A, 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 r528-tall-171683760800295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030A.tgz
mv ShieldIIPt-PT-030A 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 ;