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.r605-tall-171774426700162.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 BlocksWorld-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426700162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 42K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 240K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 93K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 500K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 32K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 192K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 87K Jun 7 06:26 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 BlocksWorld-PT-01-CTLFireability-2024-00
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-01
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-02
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-03
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-04
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-05
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-06
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-07
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-08
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-09
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-10
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-11
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-12
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-13
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-14
FORMULA_NAME BlocksWorld-PT-01-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717745477203

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:31:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 07:31:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:31:18] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-07 07:31:18] [INFO ] Transformed 109 places.
[2024-06-07 07:31:18] [INFO ] Transformed 181 transitions.
[2024-06-07 07:31:18] [INFO ] Found NUPN structural information;
[2024-06-07 07:31:18] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8]
[2024-06-07 07:31:18] [INFO ] Parsed PT model containing 109 places and 181 transitions and 896 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 109 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 181/181 transitions.
Applied a total of 0 rules in 16 ms. Remains 109 /109 variables (removed 0) and now considering 181/181 (removed 0) transitions.
// Phase 1: matrix 181 rows 109 cols
[2024-06-07 07:31:18] [INFO ] Computed 19 invariants in 15 ms
[2024-06-07 07:31:18] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-07 07:31:18] [INFO ] Invariant cache hit.
[2024-06-07 07:31:19] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-07 07:31:19] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-06-07 07:31:19] [INFO ] Invariant cache hit.
[2024-06-07 07:31:19] [INFO ] State equation strengthened by 15 read => feed constraints.
Problem TDEAD28 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 14 solved, 165 unsolved
[2024-06-07 07:31:20] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 9 ms to minimize.
[2024-06-07 07:31:20] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/17 constraints. Problems are: Problem set: 14 solved, 165 unsolved
[2024-06-07 07:31:20] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/18 constraints. Problems are: Problem set: 14 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 14 solved, 165 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/109 variables, 4/22 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:22] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-07 07:31:22] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:31:22] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 3/25 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:22] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 1/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 180/289 variables, 109/135 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 14/149 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/149 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 1/290 variables, 1/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 0/290 variables, 0/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 150 constraints, problems are : Problem set: 18 solved, 161 unsolved in 6851 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 18 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/7 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 11/109 variables, 18/25 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:27] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/27 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/27 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 180/289 variables, 109/136 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 14/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 161/311 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 20/331 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 8/339 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:34] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:31:35] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:35] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:31:35] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 4/343 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 3/346 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:40] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:31:41] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 2/348 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 2/350 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:46] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/289 variables, 1/351 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/289 variables, 2/353 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:52] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/289 variables, 1/354 constraints. Problems are: Problem set: 18 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/290 variables, and 354 constraints, problems are : Problem set: 18 solved, 161 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/15 constraints, PredecessorRefiner: 161/179 constraints, Known Traps: 51/51 constraints]
After SMT, in 37375ms problems are : Problem set: 18 solved, 161 unsolved
Search for dead transitions found 18 dead transitions in 37389ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/109 places, 163/181 transitions.
Deduced a syphon composed of 9 places in 1 ms
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37806 ms. Remains : 109/109 places, 163/181 transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Support contains 100 out of 100 places after structural reductions.
[2024-06-07 07:31:56] [INFO ] Flatten gal took : 53 ms
[2024-06-07 07:31:56] [INFO ] Flatten gal took : 47 ms
[2024-06-07 07:31:57] [INFO ] Input system was already deterministic with 163 transitions.
Reduction of identical properties reduced properties to check from 42 to 39
RANDOM walk for 40000 steps (8 resets) in 2742 ms. (14 steps per ms) remains 9/39 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 968 ms. (41 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 525 ms. (76 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 745 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 531 ms. (75 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
// Phase 1: matrix 163 rows 100 cols
[2024-06-07 07:31:59] [INFO ] Computed 19 invariants in 1 ms
[2024-06-07 07:31:59] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp35 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 19/19 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 4 solved, 5 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 19/19 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-07 07:31:59] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:31:59] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 9 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 3 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:32:00] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 20/39 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 2 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/59 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/79 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:03] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/99 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
SMT process timed out in 5494ms, After SMT, problems are : Problem set: 4 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 163/163 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 162
Applied a total of 1 rules in 15 ms. Remains 100 /100 variables (removed 0) and now considering 162/163 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 100/100 places, 162/163 transitions.
RANDOM walk for 40000 steps (8 resets) in 655 ms. (60 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 171 ms. (232 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 870 ms. (45 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 384 ms. (103 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 288183 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :1 out of 5
Probabilistic random walk after 288183 steps, saw 160029 distinct states, run finished after 3014 ms. (steps per millisecond=95 ) properties seen :1
// Phase 1: matrix 162 rows 100 cols
[2024-06-07 07:32:08] [INFO ] Computed 19 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 119 constraints, problems are : Problem set: 0 solved, 4 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 07:32:08] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/262 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 124 constraints, problems are : Problem set: 0 solved, 4 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1128ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 100/100 places, 162/162 transitions.
RANDOM walk for 40000 steps (8 resets) in 430 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 488 ms. (81 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 275262 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 4
Probabilistic random walk after 275262 steps, saw 153084 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-06-07 07:32:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 119 constraints, problems are : Problem set: 0 solved, 4 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 07:32:13] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/262 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 124 constraints, problems are : Problem set: 0 solved, 4 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1213ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 104 ms.
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 100/100 places, 162/162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2024-06-07 07:32:14] [INFO ] Invariant cache hit.
[2024-06-07 07:32:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-07 07:32:14] [INFO ] Invariant cache hit.
[2024-06-07 07:32:14] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-07 07:32:14] [INFO ] Redundant transitions in 5 ms returned []
Running 160 sub problems to find dead transitions.
[2024-06-07 07:32:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 119 constraints, problems are : Problem set: 0 solved, 160 unsolved in 2779 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 160/279 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 18/317 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:24] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:32:24] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:32:24] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:32:26] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:32:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:32:26] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:32:26] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:32:26] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:32:26] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:32:26] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:32:26] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:26] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:27] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:28] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:32:28] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:32:29] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:32:29] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-07 07:32:29] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:32:29] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:32:29] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:32:29] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:32:29] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:30] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:30] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:32:30] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:30] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:32:30] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 14/351 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:32] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:32:32] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:32:34] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:32:34] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:32:34] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:34] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:32:34] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:34] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:35] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:32:35] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:32:35] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:32:35] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 15/366 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:37] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:37] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:32:37] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:32:39] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:32:39] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:39] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:32:39] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:39] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:32:39] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:32:40] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:32:40] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 20/386 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:42] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:32:42] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:42] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:32:42] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:32:43] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:32:43] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 3 ms to minimize.
[2024-06-07 07:32:43] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:32:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:43] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:32:43] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:32:44] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:32:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:32:44] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:32:44] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:32:44] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:32:44] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:32:44] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:32:45] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:32:45] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 20/406 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:32:47] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:32:47] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:47] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:32:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/262 variables, and 411 constraints, problems are : Problem set: 0 solved, 160 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 132/132 constraints]
After SMT, in 33034ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 33037ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33141 ms. Remains : 100/100 places, 162/162 transitions.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BlocksWorld-PT-01-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:32:47] [INFO ] Flatten gal took : 22 ms
[2024-06-07 07:32:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BlocksWorld-PT-01-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:32:47] [INFO ] Flatten gal took : 46 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 10 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 24 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 10 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 20 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 22 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 19 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 7 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 7 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:32:48] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 19 ms
[2024-06-07 07:32:48] [INFO ] Flatten gal took : 19 ms
[2024-06-07 07:32:49] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 20 ms.
[2024-06-07 07:32:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 163 transitions and 806 arcs took 6 ms.
Total runtime 90671 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 : BlocksWorld-PT-01-CTLFireability-2024-00
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-01
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-03
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-04
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-05
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-06
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-07
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-08
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-09
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-10
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-11
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-13
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-14
Could not compute solution for formula : BlocksWorld-PT-01-CTLFireability-2024-15

BK_STOP 1717745569435

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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 BlocksWorld-PT-01-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1382/ctl_0_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1382/ctl_1_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1382/ctl_2_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1382/ctl_3_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1382/ctl_4_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1382/ctl_5_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1382/ctl_6_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1382/ctl_7_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1382/ctl_8_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1382/ctl_9_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1382/ctl_10_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1382/ctl_11_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1382/ctl_12_
ctl formula name BlocksWorld-PT-01-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/1382/ctl_13_
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="BlocksWorld-PT-01"
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 BlocksWorld-PT-01, 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 r605-tall-171774426700162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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