Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978500130.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-040A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978500130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 256K Mar 5 18:23 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 ShieldRVs-PT-040A-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679342179876

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:56:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 19:56:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:56:21] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-20 19:56:21] [INFO ] Transformed 563 places.
[2023-03-20 19:56:21] [INFO ] Transformed 763 transitions.
[2023-03-20 19:56:21] [INFO ] Found NUPN structural information;
[2023-03-20 19:56:21] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 221 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 44 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-20 19:56:21] [INFO ] Computed 161 place invariants in 19 ms
[2023-03-20 19:56:22] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-20 19:56:22] [INFO ] Invariant cache hit.
[2023-03-20 19:56:22] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2023-03-20 19:56:22] [INFO ] Invariant cache hit.
[2023-03-20 19:56:23] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1358 ms. Remains : 563/563 places, 763/763 transitions.
Support contains 221 out of 563 places after structural reductions.
[2023-03-20 19:56:23] [INFO ] Flatten gal took : 120 ms
[2023-03-20 19:56:23] [INFO ] Flatten gal took : 70 ms
[2023-03-20 19:56:23] [INFO ] Input system was already deterministic with 763 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 88) seen :71
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-20 19:56:24] [INFO ] Invariant cache hit.
[2023-03-20 19:56:24] [INFO ] [Real]Absence check using 161 positive place invariants in 23 ms returned sat
[2023-03-20 19:56:25] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-20 19:56:25] [INFO ] [Nat]Absence check using 161 positive place invariants in 30 ms returned sat
[2023-03-20 19:56:27] [INFO ] After 1600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-20 19:56:27] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 6 ms to minimize.
[2023-03-20 19:56:27] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-20 19:56:27] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-20 19:56:27] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2023-03-20 19:56:27] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 4 ms to minimize.
[2023-03-20 19:56:27] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2023-03-20 19:56:27] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2023-03-20 19:56:27] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-20 19:56:27] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2023-03-20 19:56:28] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2023-03-20 19:56:28] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2023-03-20 19:56:28] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-20 19:56:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1288 ms
[2023-03-20 19:56:28] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2023-03-20 19:56:28] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-20 19:56:29] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2023-03-20 19:56:29] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2023-03-20 19:56:29] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2023-03-20 19:56:29] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:56:29] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-20 19:56:29] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-20 19:56:30] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:56:30] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2023-03-20 19:56:30] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:56:30] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 3 ms to minimize.
[2023-03-20 19:56:30] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2023-03-20 19:56:30] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2023-03-20 19:56:31] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-03-20 19:56:31] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2023-03-20 19:56:31] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-03-20 19:56:31] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:56:31] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2023-03-20 19:56:31] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2023-03-20 19:56:31] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-20 19:56:32] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2023-03-20 19:56:32] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 5 ms to minimize.
[2023-03-20 19:56:32] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2023-03-20 19:56:32] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2023-03-20 19:56:32] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2023-03-20 19:56:32] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2023-03-20 19:56:32] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2023-03-20 19:56:33] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2023-03-20 19:56:33] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-20 19:56:33] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:56:33] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:56:33] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2023-03-20 19:56:33] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2023-03-20 19:56:34] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 0 ms to minimize.
[2023-03-20 19:56:34] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2023-03-20 19:56:34] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-20 19:56:34] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2023-03-20 19:56:34] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 0 ms to minimize.
[2023-03-20 19:56:34] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2023-03-20 19:56:34] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2023-03-20 19:56:35] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2023-03-20 19:56:35] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2023-03-20 19:56:35] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2023-03-20 19:56:35] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2023-03-20 19:56:35] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2023-03-20 19:56:35] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2023-03-20 19:56:35] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2023-03-20 19:56:35] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2023-03-20 19:56:35] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2023-03-20 19:56:36] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2023-03-20 19:56:36] [INFO ] Trap strengthening procedure interrupted after too many repetitions 7530 ms
[2023-03-20 19:56:36] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 7531 ms
[2023-03-20 19:56:36] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 1 ms to minimize.
[2023-03-20 19:56:36] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 0 ms to minimize.
[2023-03-20 19:56:36] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2023-03-20 19:56:36] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2023-03-20 19:56:37] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 2 ms to minimize.
[2023-03-20 19:56:37] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 0 ms to minimize.
[2023-03-20 19:56:37] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2023-03-20 19:56:37] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2023-03-20 19:56:37] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2023-03-20 19:56:37] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-20 19:56:38] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:56:38] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-20 19:56:38] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-20 19:56:38] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2023-03-20 19:56:38] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:56:38] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2023-03-20 19:56:38] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2023-03-20 19:56:39] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2023-03-20 19:56:39] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-20 19:56:39] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2023-03-20 19:56:39] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:56:39] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2023-03-20 19:56:40] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:56:40] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-20 19:56:40] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2023-03-20 19:56:40] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2023-03-20 19:56:40] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2023-03-20 19:56:40] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2023-03-20 19:56:40] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2023-03-20 19:56:41] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2023-03-20 19:56:41] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 1 ms to minimize.
[2023-03-20 19:56:41] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2023-03-20 19:56:41] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:56:41] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 0 ms to minimize.
[2023-03-20 19:56:41] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2023-03-20 19:56:42] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2023-03-20 19:56:42] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2023-03-20 19:56:42] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2023-03-20 19:56:42] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2023-03-20 19:56:42] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:56:42] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2023-03-20 19:56:42] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:56:43] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2023-03-20 19:56:43] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2023-03-20 19:56:43] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:56:43] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2023-03-20 19:56:43] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 0 ms to minimize.
[2023-03-20 19:56:43] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2023-03-20 19:56:44] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:56:44] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2023-03-20 19:56:44] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 1 ms to minimize.
[2023-03-20 19:56:44] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2023-03-20 19:56:44] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:56:44] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 0 ms to minimize.
[2023-03-20 19:56:44] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 0 ms to minimize.
[2023-03-20 19:56:45] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 1 ms to minimize.
[2023-03-20 19:56:45] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2023-03-20 19:56:45] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 0 ms to minimize.
[2023-03-20 19:56:45] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 1 ms to minimize.
[2023-03-20 19:56:45] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 0 ms to minimize.
[2023-03-20 19:56:45] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:56:45] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:56:46] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 0 ms to minimize.
[2023-03-20 19:56:46] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:56:46] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 0 ms to minimize.
[2023-03-20 19:56:46] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 0 ms to minimize.
[2023-03-20 19:56:46] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:56:46] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 1 ms to minimize.
[2023-03-20 19:56:47] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 0 ms to minimize.
[2023-03-20 19:56:47] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 1 ms to minimize.
[2023-03-20 19:56:47] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 1 ms to minimize.
[2023-03-20 19:56:47] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:56:47] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 1 ms to minimize.
[2023-03-20 19:56:47] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 1 ms to minimize.
[2023-03-20 19:56:48] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:56:48] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 1 ms to minimize.
[2023-03-20 19:56:48] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:56:48] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:56:48] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:56:48] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2023-03-20 19:56:48] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 1 ms to minimize.
[2023-03-20 19:56:49] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 0 ms to minimize.
[2023-03-20 19:56:49] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 1 ms to minimize.
[2023-03-20 19:56:49] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2023-03-20 19:56:49] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2023-03-20 19:56:49] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2023-03-20 19:56:49] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:56:50] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:56:50] [INFO ] Trap strengthening (SAT) tested/added 88/88 trap constraints in 13856 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 19:56:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 19:56:50] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Parikh walk visited 0 properties in 770 ms.
Support contains 73 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 0 with 68 rules applied. Total rules applied 70 place count 562 transition count 762
Applied a total of 70 rules in 80 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 562/563 places, 762/763 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 17) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 19:56:51] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-20 19:56:51] [INFO ] [Real]Absence check using 161 positive place invariants in 29 ms returned sat
[2023-03-20 19:56:51] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 19:56:52] [INFO ] [Nat]Absence check using 161 positive place invariants in 17 ms returned sat
[2023-03-20 19:56:52] [INFO ] After 648ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 19:56:52] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-20 19:56:53] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2023-03-20 19:56:53] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-20 19:56:53] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-20 19:56:53] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2023-03-20 19:56:53] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2023-03-20 19:56:54] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-20 19:56:54] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-20 19:56:54] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-20 19:56:54] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2023-03-20 19:56:54] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2023-03-20 19:56:54] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-20 19:56:55] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 1 ms to minimize.
[2023-03-20 19:56:55] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-20 19:56:55] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2023-03-20 19:56:55] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2023-03-20 19:56:55] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2023-03-20 19:56:55] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2023-03-20 19:56:56] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:56:56] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2023-03-20 19:56:56] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2023-03-20 19:56:56] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2023-03-20 19:56:56] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2023-03-20 19:56:56] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2023-03-20 19:56:57] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2023-03-20 19:56:57] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2023-03-20 19:56:57] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2023-03-20 19:56:57] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2023-03-20 19:56:57] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2023-03-20 19:56:57] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-20 19:56:58] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:56:58] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2023-03-20 19:56:58] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-03-20 19:56:58] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2023-03-20 19:56:58] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2023-03-20 19:56:58] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2023-03-20 19:56:58] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-20 19:56:59] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2023-03-20 19:56:59] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-20 19:56:59] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2023-03-20 19:56:59] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:56:59] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2023-03-20 19:56:59] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2023-03-20 19:56:59] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2023-03-20 19:57:00] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2023-03-20 19:57:00] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2023-03-20 19:57:00] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2023-03-20 19:57:00] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2023-03-20 19:57:00] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2023-03-20 19:57:00] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:57:00] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2023-03-20 19:57:01] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2023-03-20 19:57:01] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2023-03-20 19:57:01] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2023-03-20 19:57:01] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2023-03-20 19:57:01] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2023-03-20 19:57:01] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2023-03-20 19:57:01] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2023-03-20 19:57:01] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 0 ms to minimize.
[2023-03-20 19:57:02] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2023-03-20 19:57:02] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-20 19:57:02] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2023-03-20 19:57:02] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2023-03-20 19:57:02] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-03-20 19:57:02] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2023-03-20 19:57:02] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 9858 ms
[2023-03-20 19:57:02] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:57:02] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 ms to minimize.
[2023-03-20 19:57:03] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2023-03-20 19:57:03] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2023-03-20 19:57:03] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2023-03-20 19:57:03] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2023-03-20 19:57:03] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:57:03] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2023-03-20 19:57:03] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2023-03-20 19:57:04] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2023-03-20 19:57:04] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2023-03-20 19:57:04] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 0 ms to minimize.
[2023-03-20 19:57:04] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 1 ms to minimize.
[2023-03-20 19:57:04] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1876 ms
[2023-03-20 19:57:04] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-20 19:57:04] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-20 19:57:05] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2023-03-20 19:57:05] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-20 19:57:05] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:57:05] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2023-03-20 19:57:05] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2023-03-20 19:57:05] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2023-03-20 19:57:06] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-20 19:57:06] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2023-03-20 19:57:06] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2023-03-20 19:57:06] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2023-03-20 19:57:06] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2023-03-20 19:57:06] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2023-03-20 19:57:06] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2023-03-20 19:57:06] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2023-03-20 19:57:07] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2023-03-20 19:57:07] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-20 19:57:07] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2023-03-20 19:57:07] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2023-03-20 19:57:07] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-20 19:57:07] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2023-03-20 19:57:07] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-03-20 19:57:07] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2023-03-20 19:57:07] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2023-03-20 19:57:08] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2023-03-20 19:57:08] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2023-03-20 19:57:08] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-20 19:57:08] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2023-03-20 19:57:08] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2023-03-20 19:57:08] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2023-03-20 19:57:08] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2023-03-20 19:57:08] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-20 19:57:08] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2023-03-20 19:57:08] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2023-03-20 19:57:08] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2023-03-20 19:57:09] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2023-03-20 19:57:09] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2023-03-20 19:57:09] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2023-03-20 19:57:09] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2023-03-20 19:57:09] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-20 19:57:09] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-20 19:57:09] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2023-03-20 19:57:09] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2023-03-20 19:57:09] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-03-20 19:57:09] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-03-20 19:57:10] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2023-03-20 19:57:10] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 5508 ms
[2023-03-20 19:57:10] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2023-03-20 19:57:10] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 1 ms to minimize.
[2023-03-20 19:57:10] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-20 19:57:10] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-20 19:57:10] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-20 19:57:11] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-20 19:57:11] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-20 19:57:11] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2023-03-20 19:57:11] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2023-03-20 19:57:11] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2023-03-20 19:57:11] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2023-03-20 19:57:12] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-20 19:57:12] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2023-03-20 19:57:12] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2023-03-20 19:57:12] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2023-03-20 19:57:12] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2023-03-20 19:57:12] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:57:12] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2023-03-20 19:57:13] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2023-03-20 19:57:13] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 0 ms to minimize.
[2023-03-20 19:57:13] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 0 ms to minimize.
[2023-03-20 19:57:13] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2023-03-20 19:57:13] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2023-03-20 19:57:13] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 0 ms to minimize.
[2023-03-20 19:57:14] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2023-03-20 19:57:14] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2023-03-20 19:57:14] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:57:14] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2023-03-20 19:57:14] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 1 ms to minimize.
[2023-03-20 19:57:14] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2023-03-20 19:57:15] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-20 19:57:15] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:57:15] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2023-03-20 19:57:15] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:57:15] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2023-03-20 19:57:15] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 0 ms to minimize.
[2023-03-20 19:57:15] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 0 ms to minimize.
[2023-03-20 19:57:16] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2023-03-20 19:57:16] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2023-03-20 19:57:16] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2023-03-20 19:57:16] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 0 ms to minimize.
[2023-03-20 19:57:16] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2023-03-20 19:57:17] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 19:57:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 19:57:17] [INFO ] After 25077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 149 ms.
Support contains 25 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 562 transition count 762
Applied a total of 7 rules in 55 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 19:57:17] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-20 19:57:17] [INFO ] [Real]Absence check using 161 positive place invariants in 20 ms returned sat
[2023-03-20 19:57:18] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 19:57:18] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2023-03-20 19:57:19] [INFO ] After 658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 19:57:19] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2023-03-20 19:57:19] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-20 19:57:19] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:57:19] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-20 19:57:20] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-20 19:57:20] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2023-03-20 19:57:20] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2023-03-20 19:57:20] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2023-03-20 19:57:20] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2023-03-20 19:57:21] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-20 19:57:21] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:57:21] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-20 19:57:21] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2023-03-20 19:57:21] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2023-03-20 19:57:21] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2023-03-20 19:57:21] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2023-03-20 19:57:22] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:57:22] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2023-03-20 19:57:22] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-03-20 19:57:22] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 0 ms to minimize.
[2023-03-20 19:57:22] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2023-03-20 19:57:22] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2023-03-20 19:57:23] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 1 ms to minimize.
[2023-03-20 19:57:23] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-20 19:57:23] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-20 19:57:23] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2023-03-20 19:57:23] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-20 19:57:23] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-20 19:57:23] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2023-03-20 19:57:24] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2023-03-20 19:57:24] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-20 19:57:24] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2023-03-20 19:57:24] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-20 19:57:24] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:57:24] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2023-03-20 19:57:24] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2023-03-20 19:57:25] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2023-03-20 19:57:25] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2023-03-20 19:57:25] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2023-03-20 19:57:25] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2023-03-20 19:57:25] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-03-20 19:57:25] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2023-03-20 19:57:25] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 0 ms to minimize.
[2023-03-20 19:57:25] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:57:26] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-20 19:57:26] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2023-03-20 19:57:26] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2023-03-20 19:57:26] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:57:26] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2023-03-20 19:57:26] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2023-03-20 19:57:26] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2023-03-20 19:57:27] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 0 ms to minimize.
[2023-03-20 19:57:27] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2023-03-20 19:57:27] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-20 19:57:27] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2023-03-20 19:57:27] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2023-03-20 19:57:27] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:57:28] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2023-03-20 19:57:28] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2023-03-20 19:57:28] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:57:28] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2023-03-20 19:57:28] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2023-03-20 19:57:28] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2023-03-20 19:57:28] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2023-03-20 19:57:29] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2023-03-20 19:57:29] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2023-03-20 19:57:29] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:57:29] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:57:29] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-20 19:57:29] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2023-03-20 19:57:29] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2023-03-20 19:57:29] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2023-03-20 19:57:30] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2023-03-20 19:57:30] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2023-03-20 19:57:30] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-03-20 19:57:30] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2023-03-20 19:57:30] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 11127 ms
[2023-03-20 19:57:30] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-20 19:57:30] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-20 19:57:30] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2023-03-20 19:57:30] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2023-03-20 19:57:31] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-20 19:57:31] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-20 19:57:31] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:57:31] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2023-03-20 19:57:31] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2023-03-20 19:57:31] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2023-03-20 19:57:32] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2023-03-20 19:57:32] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2023-03-20 19:57:32] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2023-03-20 19:57:32] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2023-03-20 19:57:32] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-20 19:57:33] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2023-03-20 19:57:33] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-03-20 19:57:33] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2023-03-20 19:57:33] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2023-03-20 19:57:33] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-20 19:57:34] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-20 19:57:34] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 1 ms to minimize.
[2023-03-20 19:57:34] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2023-03-20 19:57:34] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-20 19:57:34] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2023-03-20 19:57:35] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2023-03-20 19:57:35] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2023-03-20 19:57:35] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 1 ms to minimize.
[2023-03-20 19:57:35] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 0 ms to minimize.
[2023-03-20 19:57:35] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 0 ms to minimize.
[2023-03-20 19:57:36] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-20 19:57:36] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-20 19:57:36] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2023-03-20 19:57:36] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2023-03-20 19:57:36] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-20 19:57:36] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2023-03-20 19:57:37] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2023-03-20 19:57:37] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2023-03-20 19:57:37] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-20 19:57:37] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2023-03-20 19:57:37] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2023-03-20 19:57:38] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2023-03-20 19:57:38] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2023-03-20 19:57:38] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-20 19:57:38] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2023-03-20 19:57:38] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 1 ms to minimize.
[2023-03-20 19:57:38] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-03-20 19:57:39] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2023-03-20 19:57:39] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2023-03-20 19:57:39] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2023-03-20 19:57:39] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2023-03-20 19:57:39] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2023-03-20 19:57:39] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2023-03-20 19:57:40] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-20 19:57:40] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-20 19:57:40] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-20 19:57:40] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 0 ms to minimize.
[2023-03-20 19:57:40] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2023-03-20 19:57:41] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 0 ms to minimize.
[2023-03-20 19:57:41] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2023-03-20 19:57:41] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2023-03-20 19:57:41] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-20 19:57:41] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2023-03-20 19:57:42] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2023-03-20 19:57:42] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2023-03-20 19:57:42] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-20 19:57:42] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 0 ms to minimize.
[2023-03-20 19:57:42] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2023-03-20 19:57:43] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2023-03-20 19:57:43] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2023-03-20 19:57:43] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 19:57:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 19:57:43] [INFO ] After 25139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 103 ms.
Support contains 17 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 562 transition count 762
Applied a total of 3 rules in 80 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 19:57:44] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 19:57:44] [INFO ] [Real]Absence check using 161 positive place invariants in 19 ms returned sat
[2023-03-20 19:57:44] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 19:57:44] [INFO ] [Nat]Absence check using 161 positive place invariants in 19 ms returned sat
[2023-03-20 19:57:44] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 19:57:45] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2023-03-20 19:57:45] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-20 19:57:45] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2023-03-20 19:57:45] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-20 19:57:45] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2023-03-20 19:57:45] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2023-03-20 19:57:46] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:57:46] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-20 19:57:46] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2023-03-20 19:57:46] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2023-03-20 19:57:46] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-20 19:57:47] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-20 19:57:47] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2023-03-20 19:57:47] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-20 19:57:47] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:57:47] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2023-03-20 19:57:47] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-20 19:57:47] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-20 19:57:48] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
[2023-03-20 19:57:48] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-20 19:57:48] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-20 19:57:48] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:57:48] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-20 19:57:48] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:57:48] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2023-03-20 19:57:49] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2023-03-20 19:57:49] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2023-03-20 19:57:49] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2023-03-20 19:57:49] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2023-03-20 19:57:49] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2023-03-20 19:57:49] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2023-03-20 19:57:50] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 1 ms to minimize.
[2023-03-20 19:57:50] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2023-03-20 19:57:50] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-20 19:57:50] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-20 19:57:50] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-20 19:57:50] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2023-03-20 19:57:50] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:57:51] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:57:51] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 0 ms to minimize.
[2023-03-20 19:57:51] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2023-03-20 19:57:51] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2023-03-20 19:57:51] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2023-03-20 19:57:51] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-20 19:57:51] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-20 19:57:52] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2023-03-20 19:57:52] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-20 19:57:52] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 0 ms to minimize.
[2023-03-20 19:57:52] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:57:52] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-20 19:57:52] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2023-03-20 19:57:52] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2023-03-20 19:57:53] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2023-03-20 19:57:53] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:57:53] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2023-03-20 19:57:53] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 0 ms to minimize.
[2023-03-20 19:57:53] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-20 19:57:54] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2023-03-20 19:57:54] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 0 ms to minimize.
[2023-03-20 19:57:54] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2023-03-20 19:57:54] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2023-03-20 19:57:54] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-20 19:57:55] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2023-03-20 19:57:55] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2023-03-20 19:57:55] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2023-03-20 19:57:55] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2023-03-20 19:57:55] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2023-03-20 19:57:55] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2023-03-20 19:57:56] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-20 19:57:56] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-20 19:57:56] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2023-03-20 19:57:56] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2023-03-20 19:57:56] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2023-03-20 19:57:57] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2023-03-20 19:57:57] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2023-03-20 19:57:57] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2023-03-20 19:57:57] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2023-03-20 19:57:57] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2023-03-20 19:57:57] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2023-03-20 19:57:58] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2023-03-20 19:57:58] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 0 ms to minimize.
[2023-03-20 19:57:58] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2023-03-20 19:57:58] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:57:58] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2023-03-20 19:57:58] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2023-03-20 19:57:58] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:57:59] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:57:59] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 0 ms to minimize.
[2023-03-20 19:57:59] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2023-03-20 19:57:59] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2023-03-20 19:57:59] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2023-03-20 19:57:59] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2023-03-20 19:57:59] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2023-03-20 19:58:00] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2023-03-20 19:58:00] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2023-03-20 19:58:00] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-20 19:58:00] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2023-03-20 19:58:00] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-20 19:58:00] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2023-03-20 19:58:00] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-20 19:58:00] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:58:01] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2023-03-20 19:58:01] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-03-20 19:58:01] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-20 19:58:01] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2023-03-20 19:58:01] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2023-03-20 19:58:01] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2023-03-20 19:58:02] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2023-03-20 19:58:02] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2023-03-20 19:58:02] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2023-03-20 19:58:02] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2023-03-20 19:58:02] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-20 19:58:02] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2023-03-20 19:58:03] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-20 19:58:03] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-20 19:58:03] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2023-03-20 19:58:03] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2023-03-20 19:58:03] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2023-03-20 19:58:03] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2023-03-20 19:58:04] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2023-03-20 19:58:04] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:58:04] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2023-03-20 19:58:04] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2023-03-20 19:58:04] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2023-03-20 19:58:04] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2023-03-20 19:58:04] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2023-03-20 19:58:05] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:58:05] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:58:05] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-20 19:58:05] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2023-03-20 19:58:05] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2023-03-20 19:58:05] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2023-03-20 19:58:06] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2023-03-20 19:58:06] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:58:06] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2023-03-20 19:58:06] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 0 ms to minimize.
[2023-03-20 19:58:06] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2023-03-20 19:58:06] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 1 ms to minimize.
[2023-03-20 19:58:07] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:58:07] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:58:07] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2023-03-20 19:58:07] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-20 19:58:07] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:58:07] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2023-03-20 19:58:07] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2023-03-20 19:58:08] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-20 19:58:08] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2023-03-20 19:58:08] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 1 ms to minimize.
[2023-03-20 19:58:08] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2023-03-20 19:58:08] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2023-03-20 19:58:09] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2023-03-20 19:58:09] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2023-03-20 19:58:09] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:58:09] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 19:58:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 19:58:09] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 32 ms.
Support contains 10 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 562 transition count 762
Applied a total of 1 rules in 52 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 562/562 places, 762/762 transitions.
[2023-03-20 19:58:09] [INFO ] Flatten gal took : 61 ms
[2023-03-20 19:58:09] [INFO ] Flatten gal took : 55 ms
[2023-03-20 19:58:09] [INFO ] Input system was already deterministic with 763 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 9 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 19:58:09] [INFO ] Flatten gal took : 45 ms
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 45 ms
[2023-03-20 19:58:10] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 38 ms
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 42 ms
[2023-03-20 19:58:10] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 28 ms
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 29 ms
[2023-03-20 19:58:10] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 6 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 27 ms
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 26 ms
[2023-03-20 19:58:10] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 26 ms
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 26 ms
[2023-03-20 19:58:10] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 6 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 25 ms
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 30 ms
[2023-03-20 19:58:10] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 561 transition count 761
Applied a total of 2 rules in 33 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 561/563 places, 761/763 transitions.
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 23 ms
[2023-03-20 19:58:10] [INFO ] Flatten gal took : 24 ms
[2023-03-20 19:58:11] [INFO ] Input system was already deterministic with 761 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 25 ms
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 26 ms
[2023-03-20 19:58:11] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 28 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 562/563 places, 762/763 transitions.
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 23 ms
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 24 ms
[2023-03-20 19:58:11] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 26 ms
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 23 ms
[2023-03-20 19:58:11] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 6 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 23 ms
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 27 ms
[2023-03-20 19:58:11] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 24 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 562/563 places, 762/763 transitions.
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 23 ms
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 30 ms
[2023-03-20 19:58:11] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 22 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 562/563 places, 762/763 transitions.
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 22 ms
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 25 ms
[2023-03-20 19:58:11] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 6 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 21 ms
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 24 ms
[2023-03-20 19:58:11] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 24 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 562/563 places, 762/763 transitions.
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 21 ms
[2023-03-20 19:58:11] [INFO ] Flatten gal took : 22 ms
[2023-03-20 19:58:12] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 25 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 562/563 places, 762/763 transitions.
[2023-03-20 19:58:12] [INFO ] Flatten gal took : 21 ms
[2023-03-20 19:58:12] [INFO ] Flatten gal took : 22 ms
[2023-03-20 19:58:12] [INFO ] Input system was already deterministic with 762 transitions.
[2023-03-20 19:58:12] [INFO ] Flatten gal took : 25 ms
[2023-03-20 19:58:12] [INFO ] Flatten gal took : 24 ms
[2023-03-20 19:58:12] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 19:58:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 563 places, 763 transitions and 3680 arcs took 4 ms.
Total runtime 110682 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 563 NrTr: 763 NrArc: 3680)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.029sec

net check time: 0m 0.000sec

init dd package: 0m 3.318sec


before gc: list nodes free: 1624880

after gc: idd nodes used:3613, unused:63996387; list nodes free:276804553

before gc: list nodes free: 1038886

after gc: idd nodes used:3933, unused:63996067; list nodes free:276803085

before gc: list nodes free: 920263

after gc: idd nodes used:4073, unused:63995927; list nodes free:276802113

before gc: list nodes free: 825959

after gc: idd nodes used:4154, unused:63995846; list nodes free:276801703

before gc: list nodes free: 445084

after gc: idd nodes used:4302, unused:63995698; list nodes free:276801043

before gc: list nodes free: 707041

after gc: idd nodes used:4251, unused:63995749; list nodes free:276801158

before gc: list nodes free: 1227487

after gc: idd nodes used:4205, unused:63995795; list nodes free:276801479

before gc: list nodes free: 856118

after gc: idd nodes used:4367, unused:63995633; list nodes free:276800646

before gc: list nodes free: 2080452

after gc: idd nodes used:4379, unused:63995621; list nodes free:278897695

before gc: list nodes free: 1831220

after gc: idd nodes used:4569, unused:63995431; list nodes free:278896693

before gc: list nodes free: 2250298

after gc: idd nodes used:4653, unused:63995347; list nodes free:278896206

before gc: list nodes free: 2605954

after gc: idd nodes used:4836, unused:63995164; list nodes free:278895477

before gc: list nodes free: 2290546

after gc: idd nodes used:4928, unused:63995072; list nodes free:278895010

before gc: list nodes free: 2003104

after gc: idd nodes used:4884, unused:63995116; list nodes free:278895222

before gc: list nodes free: 2115458

after gc: idd nodes used:4776, unused:63995224; list nodes free:278895792

before gc: list nodes free: 2656651

after gc: idd nodes used:4995, unused:63995005; list nodes free:278894506

before gc: list nodes free: 2453032

after gc: idd nodes used:4920, unused:63995080; list nodes free:278895148

before gc: list nodes free: 2186812

after gc: idd nodes used:5023, unused:63994977; list nodes free:278894489

before gc: list nodes free: 2028277

after gc: idd nodes used:4668, unused:63995332; list nodes free:278896270

before gc: list nodes free: 2400501

after gc: idd nodes used:4770, unused:63995230; list nodes free:278895891

before gc: list nodes free: 2204073

after gc: idd nodes used:4750, unused:63995250; list nodes free:278896079

before gc: list nodes free: 2155972

after gc: idd nodes used:4781, unused:63995219; list nodes free:278895910

before gc: list nodes free: 2445211

after gc: idd nodes used:4829, unused:63995171; list nodes free:278895757

before gc: list nodes free: 2819792

after gc: idd nodes used:4686, unused:63995314; list nodes free:278896338

before gc: list nodes free: 2673418

after gc: idd nodes used:4695, unused:63995305; list nodes free:278896310

before gc: list nodes free: 2547853

after gc: idd nodes used:4880, unused:63995120; list nodes free:278895258

before gc: list nodes free: 1148910

after gc: idd nodes used:4796, unused:63995204; list nodes free:278895554

before gc: list nodes free: 1304353

after gc: idd nodes used:4953, unused:63995047; list nodes free:278894811

before gc: list nodes free: 2347702

after gc: idd nodes used:4917, unused:63995083; list nodes free:278895005

before gc: list nodes free: 2842487

after gc: idd nodes used:4828, unused:63995172; list nodes free:278895483
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6355160 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097152 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

2819 3089 3063 3526 3329 3175 3465 3551 3755 3394 3527 3629 3606 3837 3740 3786 3860 3983 3969 3920 3955 3870 3817 3820 3793 4064 3962 3930 3846 3958 3971 4126 4146 4294 4255 4046 4185 4205 4009 4201 4220 4472 4433 4317 4348 4297 4307 4315 4066 4061 4060 4267 4150 4143 4023 4147 4218 4218 4316 4172 4177 4236 4246 4214 4061 4243 4221 4252 4192 4309 4369 4276 4289 4582 4555 4386 4454 4476 4268 4405 4372 4595 4500 4604 4627 4600 4586 4617 4711 4583 4526 4564 4741 4821 4578 4610 4684 4628 4672 4672 4681 4662 4779 4825 4804 4651 4628 4777 4668 4574 4662 5007 5282 4862 4990 4957 5028 4980 4963 4968 5215 4788 4883 4818 4869 4835 4797 4823 4705 4756 4769 4773 4883 4702 4828 4782 4829 4806 4749 4732 4915 5031 4745 4780 4858 4786 4801 4872 5199 4973 4921 5032 4954 4984 4914 4944 4861 4900 4962 4908 4927 4924 4929 4943 5091 4930 4902 4913 4661 4722 4759 4777 4722 4777 4732 4887 4686 4812 4683 4800 4688 4788 4787 4734 4691 4786 4723 4947 4813 4803 4765 4764 4770 4783 4634 4662 4813 4672 4729 4894 4643 4759 4827 4707 4826 4648 4796 4605 4771 4656 4608 4579 4680 4697 4768 4599 4625 4677 4773 4703 4715 4657 4604 4705 4735 4730 4675 4892 4698 4753 4782 4834 4815 4821 4761 4868 4713 4826 4959 4890 4881 5011 4896 4879 4967 4928 5012 4940 4874 4904 4926 4886 4908 4814 4830 4912 4836 4964 4985 4727 4747 4768 4917 4836 4727 4767 4835

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="ShieldRVs-PT-040A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is ShieldRVs-PT-040A, 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 r426-tajo-167905978500130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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