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.r500-smll-171649587500103.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 HirschbergSinclair-PT-30, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587500103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 03:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 03:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 03:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 03:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 357K 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 HirschbergSinclair-PT-30-ReachabilityFireability-2024-00
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-01
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-02
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-03
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-04
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-05
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-06
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-07
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-08
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-09
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-10
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-11
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-12
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-13
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-14
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717246681272

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:58:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:58:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:58:03] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-06-01 12:58:03] [INFO ] Transformed 670 places.
[2024-06-01 12:58:03] [INFO ] Transformed 605 transitions.
[2024-06-01 12:58:03] [INFO ] Parsed PT model containing 670 places and 605 transitions and 1849 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (64 resets) in 1636 ms. (24 steps per ms) remains 2/15 properties
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 664 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
// Phase 1: matrix 605 rows 670 cols
[2024-06-01 12:58:04] [INFO ] Computed 65 invariants in 27 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem HirschbergSinclair-PT-30-ReachabilityFireability-2024-02 is UNSAT
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 470/546 variables, 40/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 65/611 variables, 20/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/611 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/644 variables, 5/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 605/1249 variables, 644/709 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1249 variables, 0/709 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/1275 variables, 26/735 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1275 variables, 0/735 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1275 variables, 0/735 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1275/1275 variables, and 735 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 670/670 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 471/516 variables, 32/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 12:58:06] [INFO ] Deduced a trap composed of 20 places in 312 ms of which 58 ms to minimize.
[2024-06-01 12:58:06] [INFO ] Deduced a trap composed of 135 places in 225 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 88/604 variables, 26/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 12:58:06] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 5 ms to minimize.
[2024-06-01 12:58:07] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 4 ms to minimize.
[2024-06-01 12:58:07] [INFO ] Deduced a trap composed of 113 places in 258 ms of which 5 ms to minimize.
[2024-06-01 12:58:07] [INFO ] Deduced a trap composed of 112 places in 206 ms of which 4 ms to minimize.
[2024-06-01 12:58:07] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 5/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/610 variables, 2/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/643 variables, 5/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 12:58:08] [INFO ] Deduced a trap composed of 56 places in 258 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/1248 variables, 643/716 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1248 variables, 0/716 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 27/1275 variables, 27/743 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1275 variables, 1/744 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 12:58:09] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 6 ms to minimize.
[2024-06-01 12:58:09] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 6 ms to minimize.
[2024-06-01 12:58:09] [INFO ] Deduced a trap composed of 52 places in 279 ms of which 5 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 5 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 65 places in 295 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1275/1275 variables, and 749 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 670/670 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 6305ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 670/670 places, 605/605 transitions.
Graph (complete) has 1278 edges and 670 vertex of which 639 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.3 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 639 transition count 466
Reduce places removed 138 places and 0 transitions.
Graph (complete) has 879 edges and 501 vertex of which 461 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 139 rules applied. Total rules applied 279 place count 461 transition count 466
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 319 place count 461 transition count 426
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 338 place count 442 transition count 407
Iterating global reduction 3 with 19 rules applied. Total rules applied 357 place count 442 transition count 407
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 369 place count 430 transition count 395
Iterating global reduction 3 with 12 rules applied. Total rules applied 381 place count 430 transition count 395
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 399 place count 430 transition count 377
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 417 place count 412 transition count 377
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 430 place count 399 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 431 place count 398 transition count 364
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 431 place count 398 transition count 353
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 453 place count 387 transition count 353
Applied a total of 453 rules in 295 ms. Remains 387 /670 variables (removed 283) and now considering 353/605 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 387/670 places, 353/605 transitions.
RANDOM walk for 40000 steps (104 resets) in 1457 ms. (27 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (14 resets) in 686 ms. (58 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 593520 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 1
Probabilistic random walk after 593520 steps, saw 140120 distinct states, run finished after 3007 ms. (steps per millisecond=197 ) properties seen :0
// Phase 1: matrix 353 rows 387 cols
[2024-06-01 12:58:14] [INFO ] Computed 34 invariants in 5 ms
[2024-06-01 12:58:14] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 308/353 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/359 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 348/707 variables, 359/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 22/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/739 variables, 27/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/739 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/740 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/740 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/740 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 740/740 variables, and 445 constraints, problems are : Problem set: 0 solved, 1 unsolved in 574 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 387/387 constraints, ReadFeed: 24/24 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/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 308/353 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/359 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 348/707 variables, 359/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 22/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/739 variables, 27/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/739 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/739 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/740 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/740 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/740 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 740/740 variables, and 446 constraints, problems are : Problem set: 0 solved, 1 unsolved in 790 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 387/387 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1415ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 45 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 353/353 transitions.
Applied a total of 0 rules in 26 ms. Remains 387 /387 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 387/387 places, 353/353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 353/353 transitions.
Applied a total of 0 rules in 34 ms. Remains 387 /387 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-06-01 12:58:16] [INFO ] Invariant cache hit.
[2024-06-01 12:58:16] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-06-01 12:58:16] [INFO ] Invariant cache hit.
[2024-06-01 12:58:16] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-01 12:58:17] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
[2024-06-01 12:58:17] [INFO ] Redundant transitions in 25 ms returned []
Running 333 sub problems to find dead transitions.
[2024-06-01 12:58:17] [INFO ] Invariant cache hit.
[2024-06-01 12:58:17] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 18/385 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 353/738 variables, 385/419 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/738 variables, 24/443 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/738 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 333 unsolved
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 30173ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31859 ms. Remains : 387/387 places, 353/353 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 384 transition count 308
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 93 place count 339 transition count 308
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 93 place count 339 transition count 272
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 165 place count 303 transition count 272
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 175 place count 298 transition count 267
Applied a total of 175 rules in 67 ms. Remains 298 /387 variables (removed 89) and now considering 267/353 (removed 86) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 267 rows 298 cols
[2024-06-01 12:58:48] [INFO ] Computed 31 invariants in 3 ms
[2024-06-01 12:58:48] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 53 ms returned sat
[2024-06-01 12:58:48] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:58:48] [INFO ] [Nat]Absence check using 0 positive and 31 generalized place invariants in 55 ms returned sat
[2024-06-01 12:58:48] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:58:48] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:58:48] [INFO ] After 574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 863 ms.
[2024-06-01 12:58:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-06-01 12:58:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 387 places, 353 transitions and 1160 arcs took 9 ms.
[2024-06-01 12:58:49] [INFO ] Flatten gal took : 93 ms
Total runtime 46386 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 : HirschbergSinclair-PT-30-ReachabilityFireability-2024-05

BK_STOP 1717246729638

--------------------
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 HirschbergSinclair-PT-30-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/579/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="HirschbergSinclair-PT-30"
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 HirschbergSinclair-PT-30, 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 r500-smll-171649587500103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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