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.r476-tall-171620505200106.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 CANInsertWithFailure-PT-020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.6M 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 CANInsertWithFailure-PT-020-CTLFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2024-07
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2024-11
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2023-12
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2023-13
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2023-14
FORMULA_NAME CANInsertWithFailure-PT-020-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717186678233

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:17:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:17:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:17:59] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2024-05-31 20:17:59] [INFO ] Transformed 1044 places.
[2024-05-31 20:17:59] [INFO ] Transformed 2520 transitions.
[2024-05-31 20:17:59] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 139 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1043 transition count 2520
Applied a total of 1 rules in 107 ms. Remains 1043 /1044 variables (removed 1) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-31 20:17:59] [INFO ] Computed 22 invariants in 100 ms
[2024-05-31 20:18:00] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-31 20:18:00] [INFO ] Invariant cache hit.
[2024-05-31 20:18:00] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 20:18:01] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-31 20:18:01] [INFO ] Invariant cache hit.
[2024-05-31 20:18:02] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 31067ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 31109ms
Starting structural reductions in LTL mode, iteration 1 : 1043/1044 places, 2520/2520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33347 ms. Remains : 1043/1044 places, 2520/2520 transitions.
Support contains 139 out of 1043 places after structural reductions.
[2024-05-31 20:18:33] [INFO ] Flatten gal took : 151 ms
[2024-05-31 20:18:33] [INFO ] Flatten gal took : 88 ms
[2024-05-31 20:18:33] [INFO ] Input system was already deterministic with 2520 transitions.
Reduction of identical properties reduced properties to check from 98 to 97
RANDOM walk for 40000 steps (88 resets) in 1658 ms. (24 steps per ms) remains 6/97 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
[2024-05-31 20:18:34] [INFO ] Invariant cache hit.
[2024-05-31 20:18:34] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 987/1007 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:18:34] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 32/1039 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/1041 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2520/3561 variables, 1041/1064 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/3561 variables, 780/1844 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3561 variables, 0/1844 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/3563 variables, 2/1846 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3563 variables, 0/1846 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/3563 variables, 0/1846 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3563/3563 variables, and 1846 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3999 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1043/1043 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 987/1007 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 32/1039 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/1041 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2520/3561 variables, 1041/1064 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3561 variables, 780/1844 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3561 variables, 6/1850 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3561 variables, 0/1850 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 2/3563 variables, 2/1852 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3563/3563 variables, and 1852 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1043/1043 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 9057ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 1043 transition count 2385
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 1 with 135 rules applied. Total rules applied 270 place count 908 transition count 2385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 270 place count 908 transition count 2383
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 274 place count 906 transition count 2383
Performed 366 Post agglomeration using F-continuation condition.Transition count delta: 366
Deduced a syphon composed of 366 places in 1 ms
Reduce places removed 366 places and 0 transitions.
Iterating global reduction 2 with 732 rules applied. Total rules applied 1006 place count 540 transition count 2017
Drop transitions (Redundant composition of simpler transitions.) removed 331 transitions
Redundant transition composition rules discarded 331 transitions
Iterating global reduction 2 with 331 rules applied. Total rules applied 1337 place count 540 transition count 1686
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 1340 place count 540 transition count 1683
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1343 place count 537 transition count 1683
Partial Free-agglomeration rule applied 435 times.
Drop transitions (Partial Free agglomeration) removed 435 transitions
Iterating global reduction 3 with 435 rules applied. Total rules applied 1778 place count 537 transition count 1683
Partial Free-agglomeration rule applied 56 times.
Drop transitions (Partial Free agglomeration) removed 56 transitions
Iterating global reduction 3 with 56 rules applied. Total rules applied 1834 place count 537 transition count 1683
Applied a total of 1834 rules in 367 ms. Remains 537 /1043 variables (removed 506) and now considering 1683/2520 (removed 837) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 537/1043 places, 1683/2520 transitions.
RANDOM walk for 40000 steps (408 resets) in 475 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (18 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (18 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 89 ms. (444 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (17 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
// Phase 1: matrix 1683 rows 537 cols
[2024-05-31 20:18:44] [INFO ] Computed 22 invariants in 26 ms
[2024-05-31 20:18:44] [INFO ] State equation strengthened by 1580 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 481/498 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:18:44] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:18:44] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 36/534 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:18:44] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 3 ms to minimize.
[2024-05-31 20:18:45] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/535 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1683/2218 variables, 535/561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2218 variables, 1580/2141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2218 variables, 0/2141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/2220 variables, 2/2143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2220 variables, 0/2143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/2220 variables, 0/2143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2220/2220 variables, and 2143 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2187 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 537/537 constraints, ReadFeed: 1580/1580 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 481/498 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 5 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 36/534 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/535 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1683/2218 variables, 535/566 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2218 variables, 1580/2146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2218 variables, 5/2151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2218 variables, 0/2151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/2220 variables, 2/2153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2220 variables, 0/2153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/2220 variables, 0/2153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2220/2220 variables, and 2153 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4180 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 537/537 constraints, ReadFeed: 1580/1580 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 9/9 constraints]
After SMT, in 6431ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 3 properties in 673 ms.
Support contains 10 out of 537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 537/537 places, 1683/1683 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 530 transition count 1676
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 530 transition count 1675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 529 transition count 1675
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 529 transition count 1675
Applied a total of 20 rules in 90 ms. Remains 529 /537 variables (removed 8) and now considering 1675/1683 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 529/537 places, 1675/1683 transitions.
RANDOM walk for 40000 steps (411 resets) in 366 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 421601 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 2
Probabilistic random walk after 421601 steps, saw 55126 distinct states, run finished after 3004 ms. (steps per millisecond=140 ) properties seen :0
// Phase 1: matrix 1675 rows 529 cols
[2024-05-31 20:18:54] [INFO ] Computed 22 invariants in 27 ms
[2024-05-31 20:18:54] [INFO ] State equation strengthened by 1596 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/490 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:18:54] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/526 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:18:55] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 3 ms to minimize.
[2024-05-31 20:18:55] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 3 ms to minimize.
[2024-05-31 20:18:55] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 3 ms to minimize.
[2024-05-31 20:18:55] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 2 ms to minimize.
[2024-05-31 20:18:55] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 2 ms to minimize.
[2024-05-31 20:18:56] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 3 ms to minimize.
[2024-05-31 20:18:56] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 2 ms to minimize.
[2024-05-31 20:18:56] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 2 ms to minimize.
[2024-05-31 20:18:56] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 2 ms to minimize.
[2024-05-31 20:18:56] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-05-31 20:18:56] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-31 20:18:57] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:18:57] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2024-05-31 20:18:57] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:18:57] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 5 ms to minimize.
[2024-05-31 20:18:57] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-31 20:18:57] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-31 20:18:57] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:18:57] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:18:57] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/527 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1675/2202 variables, 527/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2202 variables, 1596/2166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2202 variables, 0/2166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/2204 variables, 2/2168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2204 variables, 0/2168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2204 variables, 0/2168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2204/2204 variables, and 2168 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3922 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 529/529 constraints, ReadFeed: 1596/1596 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/490 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:18:58] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/526 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/527 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1675/2202 variables, 527/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2202 variables, 1596/2167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2202 variables, 2/2169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2202 variables, 0/2169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/2204 variables, 2/2171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2204 variables, 0/2171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2204 variables, 0/2171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2204/2204 variables, and 2171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 529/529 constraints, ReadFeed: 1596/1596 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 22/22 constraints]
After SMT, in 5179ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 75 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=37 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 6 ms.
[2024-05-31 20:18:59] [INFO ] Flatten gal took : 62 ms
[2024-05-31 20:18:59] [INFO ] Flatten gal took : 61 ms
[2024-05-31 20:19:00] [INFO ] Input system was already deterministic with 2520 transitions.
Computed a total of 82 stabilizing places and 140 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 16 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:00] [INFO ] Flatten gal took : 48 ms
[2024-05-31 20:19:00] [INFO ] Flatten gal took : 51 ms
[2024-05-31 20:19:00] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:00] [INFO ] Flatten gal took : 46 ms
[2024-05-31 20:19:00] [INFO ] Flatten gal took : 50 ms
[2024-05-31 20:19:00] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 16 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:00] [INFO ] Flatten gal took : 46 ms
[2024-05-31 20:19:00] [INFO ] Flatten gal took : 49 ms
[2024-05-31 20:19:00] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1043 transition count 2383
Reduce places removed 137 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 138 rules applied. Total rules applied 275 place count 906 transition count 2382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 316 place count 885 transition count 2362
Applied a total of 316 rules in 86 ms. Remains 885 /1043 variables (removed 158) and now considering 2362/2520 (removed 158) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 87 ms. Remains : 885/1043 places, 2362/2520 transitions.
[2024-05-31 20:19:00] [INFO ] Flatten gal took : 40 ms
[2024-05-31 20:19:00] [INFO ] Flatten gal took : 45 ms
[2024-05-31 20:19:01] [INFO ] Input system was already deterministic with 2362 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:01] [INFO ] Flatten gal took : 43 ms
[2024-05-31 20:19:01] [INFO ] Flatten gal took : 51 ms
[2024-05-31 20:19:01] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 16 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:01] [INFO ] Flatten gal took : 41 ms
[2024-05-31 20:19:01] [INFO ] Flatten gal took : 44 ms
[2024-05-31 20:19:01] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 14 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:01] [INFO ] Flatten gal took : 39 ms
[2024-05-31 20:19:01] [INFO ] Flatten gal took : 43 ms
[2024-05-31 20:19:01] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:01] [INFO ] Flatten gal took : 37 ms
[2024-05-31 20:19:01] [INFO ] Flatten gal took : 44 ms
[2024-05-31 20:19:01] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 14 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:01] [INFO ] Flatten gal took : 38 ms
[2024-05-31 20:19:01] [INFO ] Flatten gal took : 40 ms
[2024-05-31 20:19:02] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 14 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:02] [INFO ] Flatten gal took : 38 ms
[2024-05-31 20:19:02] [INFO ] Flatten gal took : 39 ms
[2024-05-31 20:19:02] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:02] [INFO ] Flatten gal took : 36 ms
[2024-05-31 20:19:02] [INFO ] Flatten gal took : 48 ms
[2024-05-31 20:19:02] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 14 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:02] [INFO ] Flatten gal took : 35 ms
[2024-05-31 20:19:02] [INFO ] Flatten gal took : 39 ms
[2024-05-31 20:19:02] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 22 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:02] [INFO ] Flatten gal took : 36 ms
[2024-05-31 20:19:02] [INFO ] Flatten gal took : 40 ms
[2024-05-31 20:19:02] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1043 transition count 2383
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 1 with 137 rules applied. Total rules applied 274 place count 906 transition count 2383
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 314 place count 886 transition count 2363
Applied a total of 314 rules in 67 ms. Remains 886 /1043 variables (removed 157) and now considering 2363/2520 (removed 157) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 886/1043 places, 2363/2520 transitions.
[2024-05-31 20:19:02] [INFO ] Flatten gal took : 35 ms
[2024-05-31 20:19:02] [INFO ] Flatten gal took : 37 ms
[2024-05-31 20:19:03] [INFO ] Input system was already deterministic with 2363 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:19:03] [INFO ] Flatten gal took : 36 ms
[2024-05-31 20:19:03] [INFO ] Flatten gal took : 38 ms
[2024-05-31 20:19:03] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1043 transition count 2384
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 1 with 136 rules applied. Total rules applied 272 place count 907 transition count 2384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 272 place count 907 transition count 2383
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 274 place count 906 transition count 2383
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 312 place count 887 transition count 2364
Applied a total of 312 rules in 71 ms. Remains 887 /1043 variables (removed 156) and now considering 2364/2520 (removed 156) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 887/1043 places, 2364/2520 transitions.
[2024-05-31 20:19:03] [INFO ] Flatten gal took : 34 ms
[2024-05-31 20:19:03] [INFO ] Flatten gal took : 38 ms
[2024-05-31 20:19:03] [INFO ] Input system was already deterministic with 2364 transitions.
[2024-05-31 20:19:03] [INFO ] Flatten gal took : 39 ms
[2024-05-31 20:19:03] [INFO ] Flatten gal took : 38 ms
[2024-05-31 20:19:03] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-31 20:19:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1043 places, 2520 transitions and 6760 arcs took 11 ms.
Total runtime 64239 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 : CANInsertWithFailure-PT-020-CTLFireability-2024-00
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2024-01
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2024-02
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2024-03
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2024-04
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2024-05
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2024-06
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2024-07
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2024-08
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2024-09
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2024-10
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2024-11
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2023-12
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2023-13
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2023-14
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLFireability-2023-15

BK_STOP 1717186743939

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/639/ctl_0_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/639/ctl_1_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/639/ctl_2_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/639/ctl_3_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/639/ctl_4_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/639/ctl_5_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/639/ctl_6_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/639/ctl_7_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/639/ctl_8_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/639/ctl_9_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/639/ctl_10_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/639/ctl_11_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/639/ctl_12_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/639/ctl_13_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/639/ctl_14_
ctl formula name CANInsertWithFailure-PT-020-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/639/ctl_15_
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="CANInsertWithFailure-PT-020"
export BK_EXAMINATION="CTLFireability"
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 CANInsertWithFailure-PT-020, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505200106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-020.tgz
mv CANInsertWithFailure-PT-020 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;