Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r320-tall-167873970600407.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is PolyORBNT-COL-S05J40, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r320-tall-167873970600407
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 23:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 23:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 23:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 23:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678871750330

Running Version 202205111006
[2023-03-15 09:15:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 09:15:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:15:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 09:15:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 09:15:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 763 ms
[2023-03-15 09:15:52] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 22 ms.
[2023-03-15 09:15:52] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 51 ms.
[2023-03-15 09:15:52] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 09:15:52] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 09:15:52] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 09:15:52] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 662 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 36) seen :35
Incomplete Best-First random walk after 10001 steps, including 150 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:15:53] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2023-03-15 09:15:53] [INFO ] Computed 102 place invariants in 127 ms
[2023-03-15 09:15:53] [INFO ] [Real]Absence check using 95 positive place invariants in 55 ms returned sat
[2023-03-15 09:15:53] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 09:15:53] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:15:53] [INFO ] [Nat]Absence check using 95 positive place invariants in 31 ms returned sat
[2023-03-15 09:15:53] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 09:15:54] [INFO ] After 872ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:15:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:15:59] [INFO ] After 4730ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:15:59] [INFO ] After 4806ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-15 09:15:59] [INFO ] After 5924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 629 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 624 transition count 889
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 578 transition count 889
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 97 place count 578 transition count 844
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 187 place count 533 transition count 844
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 532 transition count 843
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 532 transition count 843
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 530 transition count 841
Applied a total of 193 rules in 203 ms. Remains 530 /629 variables (removed 99) and now considering 841/935 (removed 94) transitions.
[2023-03-15 09:15:59] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
// Phase 1: matrix 837 rows 530 cols
[2023-03-15 09:15:59] [INFO ] Computed 97 place invariants in 40 ms
[2023-03-15 09:16:00] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 530/629 places, 746/935 transitions.
Applied a total of 0 rules in 40 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/629 places, 746/935 transitions.
Incomplete random walk after 1000000 steps, including 51839 resets, run finished after 4143 ms. (steps per millisecond=241 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4578 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2736184 steps, run timeout after 15001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 2736184 steps, saw 821091 distinct states, run finished after 15002 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:16:20] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:16:20] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-15 09:16:20] [INFO ] [Real]Absence check using 90 positive place invariants in 22 ms returned sat
[2023-03-15 09:16:20] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 09:16:20] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:16:20] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-15 09:16:20] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 09:16:21] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:16:21] [INFO ] After 163ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:21] [INFO ] Deduced a trap composed of 180 places in 239 ms of which 2 ms to minimize.
[2023-03-15 09:16:21] [INFO ] Deduced a trap composed of 176 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:16:22] [INFO ] Deduced a trap composed of 179 places in 243 ms of which 2 ms to minimize.
[2023-03-15 09:16:22] [INFO ] Deduced a trap composed of 170 places in 255 ms of which 1 ms to minimize.
[2023-03-15 09:16:22] [INFO ] Deduced a trap composed of 167 places in 250 ms of which 1 ms to minimize.
[2023-03-15 09:16:23] [INFO ] Deduced a trap composed of 182 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:16:23] [INFO ] Deduced a trap composed of 176 places in 172 ms of which 1 ms to minimize.
[2023-03-15 09:16:23] [INFO ] Deduced a trap composed of 167 places in 264 ms of which 1 ms to minimize.
[2023-03-15 09:16:23] [INFO ] Deduced a trap composed of 167 places in 319 ms of which 1 ms to minimize.
[2023-03-15 09:16:24] [INFO ] Deduced a trap composed of 167 places in 807 ms of which 34 ms to minimize.
[2023-03-15 09:16:25] [INFO ] Deduced a trap composed of 179 places in 271 ms of which 2 ms to minimize.
[2023-03-15 09:16:25] [INFO ] Deduced a trap composed of 162 places in 283 ms of which 0 ms to minimize.
[2023-03-15 09:16:25] [INFO ] Deduced a trap composed of 161 places in 184 ms of which 0 ms to minimize.
[2023-03-15 09:16:26] [INFO ] Deduced a trap composed of 176 places in 171 ms of which 0 ms to minimize.
[2023-03-15 09:16:27] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:16:27] [INFO ] Deduced a trap composed of 152 places in 176 ms of which 1 ms to minimize.
[2023-03-15 09:16:27] [INFO ] Deduced a trap composed of 167 places in 159 ms of which 0 ms to minimize.
[2023-03-15 09:16:27] [INFO ] Deduced a trap composed of 155 places in 188 ms of which 0 ms to minimize.
[2023-03-15 09:16:28] [INFO ] Deduced a trap composed of 170 places in 169 ms of which 0 ms to minimize.
[2023-03-15 09:16:28] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 1 ms to minimize.
[2023-03-15 09:16:28] [INFO ] Deduced a trap composed of 179 places in 181 ms of which 1 ms to minimize.
[2023-03-15 09:16:29] [INFO ] Deduced a trap composed of 146 places in 165 ms of which 1 ms to minimize.
[2023-03-15 09:16:30] [INFO ] Deduced a trap composed of 173 places in 189 ms of which 0 ms to minimize.
[2023-03-15 09:16:31] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 0 ms to minimize.
[2023-03-15 09:16:31] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 1 ms to minimize.
[2023-03-15 09:16:31] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 0 ms to minimize.
[2023-03-15 09:16:32] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:16:32] [INFO ] Deduced a trap composed of 167 places in 164 ms of which 1 ms to minimize.
[2023-03-15 09:16:41] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 20474 ms
[2023-03-15 09:16:41] [INFO ] After 20732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:16:41] [INFO ] After 21182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 33 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 21 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-15 09:16:42] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:16:42] [INFO ] Computed 97 place invariants in 14 ms
[2023-03-15 09:16:42] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-15 09:16:42] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:16:42] [INFO ] Computed 97 place invariants in 9 ms
[2023-03-15 09:16:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:16:44] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 2116 ms to find 0 implicit places.
[2023-03-15 09:16:44] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-15 09:16:44] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:16:44] [INFO ] Computed 97 place invariants in 18 ms
[2023-03-15 09:16:44] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Incomplete random walk after 100000 steps, including 5180 resets, run finished after 473 ms. (steps per millisecond=211 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:16:45] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:16:45] [INFO ] Computed 97 place invariants in 18 ms
[2023-03-15 09:16:45] [INFO ] [Real]Absence check using 90 positive place invariants in 23 ms returned sat
[2023-03-15 09:16:45] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 09:16:45] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:16:45] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-15 09:16:45] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 09:16:45] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:16:45] [INFO ] After 155ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:45] [INFO ] Deduced a trap composed of 180 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:16:46] [INFO ] Deduced a trap composed of 176 places in 184 ms of which 1 ms to minimize.
[2023-03-15 09:16:46] [INFO ] Deduced a trap composed of 179 places in 184 ms of which 1 ms to minimize.
[2023-03-15 09:16:46] [INFO ] Deduced a trap composed of 170 places in 191 ms of which 1 ms to minimize.
[2023-03-15 09:16:46] [INFO ] Deduced a trap composed of 167 places in 179 ms of which 1 ms to minimize.
[2023-03-15 09:16:47] [INFO ] Deduced a trap composed of 182 places in 161 ms of which 1 ms to minimize.
[2023-03-15 09:16:47] [INFO ] Deduced a trap composed of 176 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:16:47] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 0 ms to minimize.
[2023-03-15 09:16:47] [INFO ] Deduced a trap composed of 167 places in 192 ms of which 0 ms to minimize.
[2023-03-15 09:16:47] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 0 ms to minimize.
[2023-03-15 09:16:48] [INFO ] Deduced a trap composed of 179 places in 161 ms of which 1 ms to minimize.
[2023-03-15 09:16:48] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 1 ms to minimize.
[2023-03-15 09:16:48] [INFO ] Deduced a trap composed of 161 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:16:49] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:16:49] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:16:50] [INFO ] Deduced a trap composed of 152 places in 161 ms of which 0 ms to minimize.
[2023-03-15 09:16:50] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:16:50] [INFO ] Deduced a trap composed of 155 places in 164 ms of which 1 ms to minimize.
[2023-03-15 09:16:51] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 1 ms to minimize.
[2023-03-15 09:16:51] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 1 ms to minimize.
[2023-03-15 09:16:51] [INFO ] Deduced a trap composed of 179 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:16:51] [INFO ] Deduced a trap composed of 146 places in 161 ms of which 1 ms to minimize.
[2023-03-15 09:16:53] [INFO ] Deduced a trap composed of 173 places in 163 ms of which 0 ms to minimize.
[2023-03-15 09:16:54] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 0 ms to minimize.
[2023-03-15 09:16:54] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:16:54] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 0 ms to minimize.
[2023-03-15 09:16:54] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 1 ms to minimize.
[2023-03-15 09:16:55] [INFO ] Deduced a trap composed of 167 places in 166 ms of which 3 ms to minimize.
[2023-03-15 09:17:04] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 18797 ms
[2023-03-15 09:17:04] [INFO ] After 19012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:17:04] [INFO ] After 19341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52217 resets, run finished after 4094 ms. (steps per millisecond=244 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4617 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2753796 steps, run timeout after 15001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 2753796 steps, saw 825559 distinct states, run finished after 15002 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:17:24] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:17:24] [INFO ] Computed 97 place invariants in 14 ms
[2023-03-15 09:17:24] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-15 09:17:24] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 09:17:24] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:17:25] [INFO ] [Nat]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-15 09:17:25] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 09:17:25] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:17:25] [INFO ] After 167ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:25] [INFO ] Deduced a trap composed of 180 places in 169 ms of which 1 ms to minimize.
[2023-03-15 09:17:25] [INFO ] Deduced a trap composed of 176 places in 166 ms of which 1 ms to minimize.
[2023-03-15 09:17:26] [INFO ] Deduced a trap composed of 179 places in 164 ms of which 0 ms to minimize.
[2023-03-15 09:17:26] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 0 ms to minimize.
[2023-03-15 09:17:26] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 0 ms to minimize.
[2023-03-15 09:17:26] [INFO ] Deduced a trap composed of 182 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:17:26] [INFO ] Deduced a trap composed of 176 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 167 places in 152 ms of which 1 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 167 places in 164 ms of which 2 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 167 places in 162 ms of which 1 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 179 places in 164 ms of which 0 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:17:28] [INFO ] Deduced a trap composed of 161 places in 168 ms of which 1 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 176 places in 164 ms of which 1 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 152 places in 174 ms of which 0 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 0 ms to minimize.
[2023-03-15 09:17:30] [INFO ] Deduced a trap composed of 155 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:17:30] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 0 ms to minimize.
[2023-03-15 09:17:31] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:17:31] [INFO ] Deduced a trap composed of 179 places in 167 ms of which 0 ms to minimize.
[2023-03-15 09:17:31] [INFO ] Deduced a trap composed of 146 places in 161 ms of which 0 ms to minimize.
[2023-03-15 09:17:32] [INFO ] Deduced a trap composed of 173 places in 159 ms of which 0 ms to minimize.
[2023-03-15 09:17:33] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:17:33] [INFO ] Deduced a trap composed of 173 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:17:34] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 1 ms to minimize.
[2023-03-15 09:17:34] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:17:35] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:17:44] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 18681 ms
[2023-03-15 09:17:44] [INFO ] After 18930ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:17:44] [INFO ] After 19297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 22 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 26 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-15 09:17:44] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:17:44] [INFO ] Computed 97 place invariants in 11 ms
[2023-03-15 09:17:44] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-15 09:17:44] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:17:44] [INFO ] Computed 97 place invariants in 14 ms
[2023-03-15 09:17:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:17:46] [INFO ] Implicit Places using invariants and state equation in 2135 ms returned []
Implicit Place search using SMT with State Equation took 2610 ms to find 0 implicit places.
[2023-03-15 09:17:46] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-15 09:17:46] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:17:46] [INFO ] Computed 97 place invariants in 17 ms
[2023-03-15 09:17:47] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Incomplete random walk after 100000 steps, including 5197 resets, run finished after 441 ms. (steps per millisecond=226 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:17:47] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:17:47] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-15 09:17:47] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-15 09:17:47] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 09:17:47] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:17:48] [INFO ] [Nat]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-15 09:17:48] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 09:17:48] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:17:48] [INFO ] After 157ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 180 places in 176 ms of which 0 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 176 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:17:49] [INFO ] Deduced a trap composed of 179 places in 165 ms of which 0 ms to minimize.
[2023-03-15 09:17:49] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:17:49] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:17:49] [INFO ] Deduced a trap composed of 182 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:17:49] [INFO ] Deduced a trap composed of 176 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:17:50] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:17:50] [INFO ] Deduced a trap composed of 167 places in 152 ms of which 1 ms to minimize.
[2023-03-15 09:17:50] [INFO ] Deduced a trap composed of 167 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:17:50] [INFO ] Deduced a trap composed of 179 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:17:50] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 0 ms to minimize.
[2023-03-15 09:17:51] [INFO ] Deduced a trap composed of 161 places in 164 ms of which 1 ms to minimize.
[2023-03-15 09:17:52] [INFO ] Deduced a trap composed of 176 places in 144 ms of which 0 ms to minimize.
[2023-03-15 09:17:52] [INFO ] Deduced a trap composed of 162 places in 165 ms of which 2 ms to minimize.
[2023-03-15 09:17:52] [INFO ] Deduced a trap composed of 152 places in 150 ms of which 0 ms to minimize.
[2023-03-15 09:17:52] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 1 ms to minimize.
[2023-03-15 09:17:53] [INFO ] Deduced a trap composed of 155 places in 154 ms of which 0 ms to minimize.
[2023-03-15 09:17:53] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:17:53] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:17:54] [INFO ] Deduced a trap composed of 179 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:17:54] [INFO ] Deduced a trap composed of 146 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:17:55] [INFO ] Deduced a trap composed of 173 places in 159 ms of which 1 ms to minimize.
[2023-03-15 09:17:56] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:17:56] [INFO ] Deduced a trap composed of 173 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:17:57] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:17:57] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 0 ms to minimize.
[2023-03-15 09:17:57] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:18:06] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 18471 ms
[2023-03-15 09:18:07] [INFO ] After 18720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:18:07] [INFO ] After 19070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 518 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 503294 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 503294 steps, saw 150777 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:18:10] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:18:10] [INFO ] Computed 97 place invariants in 17 ms
[2023-03-15 09:18:10] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-15 09:18:10] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 09:18:10] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:18:10] [INFO ] [Nat]Absence check using 90 positive place invariants in 22 ms returned sat
[2023-03-15 09:18:10] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 09:18:10] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:18:10] [INFO ] After 164ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:10] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 1 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 161 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 161 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 185 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 173 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 167 places in 152 ms of which 1 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 1 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 1 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 152 places in 150 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 155 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 167 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:18:14] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:18:14] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:18:14] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 0 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 179 places in 154 ms of which 0 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 173 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 161 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 173 places in 151 ms of which 1 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 0 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 167 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 1 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 1 ms to minimize.
[2023-03-15 09:18:18] [INFO ] Deduced a trap composed of 179 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:18:18] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:18:18] [INFO ] Deduced a trap composed of 176 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:18:18] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 0 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 177 places in 151 ms of which 0 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:18:20] [INFO ] Deduced a trap composed of 167 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:18:20] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:18:20] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 0 ms to minimize.
[2023-03-15 09:18:22] [INFO ] Deduced a trap composed of 176 places in 145 ms of which 0 ms to minimize.
[2023-03-15 09:18:22] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 0 ms to minimize.
[2023-03-15 09:18:23] [INFO ] Deduced a trap composed of 176 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:18:23] [INFO ] Deduced a trap composed of 158 places in 148 ms of which 0 ms to minimize.
[2023-03-15 09:18:24] [INFO ] Deduced a trap composed of 167 places in 151 ms of which 1 ms to minimize.
[2023-03-15 09:18:24] [INFO ] Deduced a trap composed of 182 places in 148 ms of which 0 ms to minimize.
[2023-03-15 09:18:33] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 23089 ms
[2023-03-15 09:18:33] [INFO ] After 23343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:18:33] [INFO ] After 23673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 35 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-15 09:18:33] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:18:33] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-15 09:18:34] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Incomplete random walk after 10000 steps, including 501 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 508369 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 508369 steps, saw 152324 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:18:37] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:18:37] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-15 09:18:37] [INFO ] [Real]Absence check using 90 positive place invariants in 15 ms returned sat
[2023-03-15 09:18:37] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 09:18:37] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:18:37] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-15 09:18:37] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:18:37] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:18:38] [INFO ] After 161ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 1 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 161 places in 145 ms of which 0 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 0 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 176 places in 143 ms of which 0 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 185 places in 147 ms of which 1 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 173 places in 170 ms of which 1 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 1 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 167 places in 142 ms of which 0 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 167 places in 141 ms of which 0 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 170 places in 144 ms of which 1 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 173 places in 145 ms of which 0 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 173 places in 144 ms of which 0 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 152 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 155 places in 148 ms of which 0 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 167 places in 143 ms of which 0 ms to minimize.
[2023-03-15 09:18:41] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:18:41] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 1 ms to minimize.
[2023-03-15 09:18:41] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 0 ms to minimize.
[2023-03-15 09:18:41] [INFO ] Deduced a trap composed of 167 places in 144 ms of which 1 ms to minimize.
[2023-03-15 09:18:42] [INFO ] Deduced a trap composed of 167 places in 142 ms of which 1 ms to minimize.
[2023-03-15 09:18:42] [INFO ] Deduced a trap composed of 161 places in 145 ms of which 1 ms to minimize.
[2023-03-15 09:18:42] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 0 ms to minimize.
[2023-03-15 09:18:42] [INFO ] Deduced a trap composed of 179 places in 142 ms of which 0 ms to minimize.
[2023-03-15 09:18:42] [INFO ] Deduced a trap composed of 173 places in 161 ms of which 0 ms to minimize.
[2023-03-15 09:18:43] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 0 ms to minimize.
[2023-03-15 09:18:43] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 1 ms to minimize.
[2023-03-15 09:18:43] [INFO ] Deduced a trap composed of 173 places in 161 ms of which 1 ms to minimize.
[2023-03-15 09:18:43] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 0 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 167 places in 152 ms of which 1 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 0 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 2 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 179 places in 159 ms of which 0 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 176 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 155 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:18:47] [INFO ] Deduced a trap composed of 177 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:18:47] [INFO ] Deduced a trap composed of 173 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:18:47] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 1 ms to minimize.
[2023-03-15 09:18:47] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:18:47] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:18:49] [INFO ] Deduced a trap composed of 176 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:18:50] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:18:50] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:18:51] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:18:51] [INFO ] Deduced a trap composed of 167 places in 159 ms of which 1 ms to minimize.
[2023-03-15 09:18:52] [INFO ] Deduced a trap composed of 182 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:19:01] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 23118 ms
[2023-03-15 09:19:01] [INFO ] After 23410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:19:01] [INFO ] After 23776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 27 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 16 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-15 09:19:01] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:19:01] [INFO ] Computed 97 place invariants in 9 ms
[2023-03-15 09:19:01] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-15 09:19:01] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:19:01] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-15 09:19:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:19:03] [INFO ] Implicit Places using invariants and state equation in 1868 ms returned []
Implicit Place search using SMT with State Equation took 2333 ms to find 0 implicit places.
[2023-03-15 09:19:03] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-15 09:19:03] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 09:19:03] [INFO ] Computed 97 place invariants in 13 ms
[2023-03-15 09:19:04] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 530 transition count 741
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 74 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 735 rows 523 cols
[2023-03-15 09:19:04] [INFO ] Computed 97 place invariants in 8 ms
[2023-03-15 09:19:04] [INFO ] [Real]Absence check using 90 positive place invariants in 27 ms returned sat
[2023-03-15 09:19:04] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 09:19:04] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:19:04] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-15 09:19:04] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 09:19:04] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:19:05] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 0 ms to minimize.
[2023-03-15 09:19:05] [INFO ] Deduced a trap composed of 150 places in 161 ms of which 1 ms to minimize.
[2023-03-15 09:19:05] [INFO ] Deduced a trap composed of 171 places in 163 ms of which 0 ms to minimize.
[2023-03-15 09:19:05] [INFO ] Deduced a trap composed of 183 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:19:05] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 0 ms to minimize.
[2023-03-15 09:19:06] [INFO ] Deduced a trap composed of 165 places in 179 ms of which 1 ms to minimize.
[2023-03-15 09:19:06] [INFO ] Deduced a trap composed of 147 places in 154 ms of which 0 ms to minimize.
[2023-03-15 09:19:06] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:19:06] [INFO ] Deduced a trap composed of 165 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:19:06] [INFO ] Deduced a trap composed of 171 places in 179 ms of which 1 ms to minimize.
[2023-03-15 09:19:07] [INFO ] Deduced a trap composed of 153 places in 152 ms of which 0 ms to minimize.
[2023-03-15 09:19:07] [INFO ] Deduced a trap composed of 171 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:19:07] [INFO ] Deduced a trap composed of 177 places in 166 ms of which 0 ms to minimize.
[2023-03-15 09:19:07] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 171 places in 150 ms of which 0 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 162 places in 159 ms of which 1 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 168 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 174 places in 151 ms of which 0 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 153 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 162 places in 149 ms of which 0 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 153 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 183 places in 150 ms of which 1 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 183 places in 146 ms of which 0 ms to minimize.
[2023-03-15 09:19:10] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 0 ms to minimize.
[2023-03-15 09:19:10] [INFO ] Deduced a trap composed of 168 places in 152 ms of which 1 ms to minimize.
[2023-03-15 09:19:10] [INFO ] Deduced a trap composed of 162 places in 159 ms of which 0 ms to minimize.
[2023-03-15 09:19:10] [INFO ] Deduced a trap composed of 174 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:19:10] [INFO ] Deduced a trap composed of 159 places in 146 ms of which 1 ms to minimize.
[2023-03-15 09:19:11] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 0 ms to minimize.
[2023-03-15 09:19:11] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 0 ms to minimize.
[2023-03-15 09:19:11] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 0 ms to minimize.
[2023-03-15 09:19:11] [INFO ] Deduced a trap composed of 156 places in 151 ms of which 1 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 165 places in 162 ms of which 1 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 150 places in 156 ms of which 1 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 168 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 177 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:19:13] [INFO ] Deduced a trap composed of 159 places in 161 ms of which 0 ms to minimize.
[2023-03-15 09:19:13] [INFO ] Deduced a trap composed of 153 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:19:13] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 1 ms to minimize.
[2023-03-15 09:19:13] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:19:14] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 1 ms to minimize.
[2023-03-15 09:19:14] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:19:14] [INFO ] Deduced a trap composed of 165 places in 162 ms of which 3 ms to minimize.
[2023-03-15 09:19:14] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:19:14] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:19:15] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:19:15] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:19:15] [INFO ] Deduced a trap composed of 159 places in 169 ms of which 6 ms to minimize.
[2023-03-15 09:19:15] [INFO ] Deduced a trap composed of 165 places in 145 ms of which 0 ms to minimize.
[2023-03-15 09:19:15] [INFO ] Deduced a trap composed of 162 places in 148 ms of which 1 ms to minimize.
[2023-03-15 09:19:16] [INFO ] Deduced a trap composed of 174 places in 151 ms of which 0 ms to minimize.
[2023-03-15 09:19:16] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 1 ms to minimize.
[2023-03-15 09:19:16] [INFO ] Deduced a trap composed of 162 places in 148 ms of which 1 ms to minimize.
[2023-03-15 09:19:17] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 0 ms to minimize.
[2023-03-15 09:19:17] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 0 ms to minimize.
[2023-03-15 09:19:17] [INFO ] Deduced a trap composed of 156 places in 161 ms of which 0 ms to minimize.
[2023-03-15 09:19:17] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:19:17] [INFO ] Deduced a trap composed of 159 places in 149 ms of which 1 ms to minimize.
[2023-03-15 09:19:18] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 1 ms to minimize.
[2023-03-15 09:19:18] [INFO ] Deduced a trap composed of 171 places in 154 ms of which 0 ms to minimize.
[2023-03-15 09:19:18] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 1 ms to minimize.
[2023-03-15 09:19:18] [INFO ] Deduced a trap composed of 162 places in 148 ms of which 1 ms to minimize.
[2023-03-15 09:19:19] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 1 ms to minimize.
[2023-03-15 09:19:19] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:19:19] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:19:19] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:19:20] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:19:20] [INFO ] Deduced a trap composed of 171 places in 146 ms of which 0 ms to minimize.
[2023-03-15 09:19:20] [INFO ] Deduced a trap composed of 153 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:19:20] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:19:21] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 1 ms to minimize.
[2023-03-15 09:19:21] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 0 ms to minimize.
[2023-03-15 09:19:22] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 1 ms to minimize.
[2023-03-15 09:19:22] [INFO ] Deduced a trap composed of 159 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:19:23] [INFO ] Deduced a trap composed of 150 places in 164 ms of which 0 ms to minimize.
[2023-03-15 09:19:23] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 0 ms to minimize.
[2023-03-15 09:19:24] [INFO ] Deduced a trap composed of 156 places in 161 ms of which 1 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 0 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 156 places in 161 ms of which 1 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 165 places in 159 ms of which 0 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 1 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:19:27] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:19:28] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:19:30] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 0 ms to minimize.
[2023-03-15 09:19:30] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 1 ms to minimize.
[2023-03-15 09:19:30] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 1 ms to minimize.
[2023-03-15 09:19:30] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 0 ms to minimize.
[2023-03-15 09:19:31] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:19:31] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:19:31] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:19:31] [INFO ] Deduced a trap composed of 171 places in 152 ms of which 1 ms to minimize.
[2023-03-15 09:19:32] [INFO ] Deduced a trap composed of 153 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:19:32] [INFO ] Deduced a trap composed of 153 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:19:32] [INFO ] Deduced a trap composed of 183 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:19:32] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 1 ms to minimize.
[2023-03-15 09:19:33] [INFO ] Deduced a trap composed of 150 places in 162 ms of which 1 ms to minimize.
[2023-03-15 09:19:33] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:19:34] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:19:35] [INFO ] Deduced a trap composed of 169 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:19:35] [INFO ] Deduced a trap composed of 153 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:19:35] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 0 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 171 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 1 ms to minimize.
[2023-03-15 09:19:37] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 177 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 153 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 1 ms to minimize.
[2023-03-15 09:19:43] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 165 places in 163 ms of which 1 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 183 places in 159 ms of which 0 ms to minimize.
[2023-03-15 09:19:45] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 0 ms to minimize.
[2023-03-15 09:19:47] [INFO ] Deduced a trap composed of 177 places in 159 ms of which 1 ms to minimize.
[2023-03-15 09:19:56] [INFO ] Trap strengthening (SAT) tested/added 120/120 trap constraints in 51449 ms
[2023-03-15 09:19:56] [INFO ] After 51857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:19:56] [INFO ] After 51964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:19:56] [INFO ] Flatten gal took : 111 ms
[2023-03-15 09:19:56] [INFO ] Flatten gal took : 81 ms
[2023-03-15 09:19:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1017490378710897531.gal : 23 ms
[2023-03-15 09:19:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7791322427365104464.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3102839378711250927;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1017490378710897531.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7791322427365104464.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality7791322427365104464.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :21 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31 after 33
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :33 after 37
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :37 after 51
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :51 after 95
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :95 after 1501
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1501 after 1759
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1759 after 2570
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2570 after 3664
Detected timeout of ITS tools.
[2023-03-15 09:20:11] [INFO ] Flatten gal took : 60 ms
[2023-03-15 09:20:11] [INFO ] Applying decomposition
[2023-03-15 09:20:11] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15514341160322219123.txt' '-o' '/tmp/graph15514341160322219123.bin' '-w' '/tmp/graph15514341160322219123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15514341160322219123.bin' '-l' '-1' '-v' '-w' '/tmp/graph15514341160322219123.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:20:12] [INFO ] Decomposing Gal with order
[2023-03-15 09:20:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:20:12] [INFO ] Removed a total of 936 redundant transitions.
[2023-03-15 09:20:12] [INFO ] Flatten gal took : 198 ms
[2023-03-15 09:20:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 189 labels/synchronizations in 30 ms.
[2023-03-15 09:20:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18160509817310296723.gal : 12 ms
[2023-03-15 09:20:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15573639773946096664.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3102839378711250927;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18160509817310296723.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15573639773946096664.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality15573639773946096664.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16926908902056252823
[2023-03-15 09:20:27] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16926908902056252823
Running compilation step : cd /tmp/ltsmin16926908902056252823;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1373 ms.
Running link step : cd /tmp/ltsmin16926908902056252823;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16926908902056252823;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 530 transition count 741
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 86 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 735 rows 523 cols
[2023-03-15 09:20:42] [INFO ] Computed 97 place invariants in 9 ms
[2023-03-15 09:20:42] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-15 09:20:42] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 09:20:42] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:20:42] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-15 09:20:42] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 09:20:43] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:20:43] [INFO ] Deduced a trap composed of 165 places in 162 ms of which 1 ms to minimize.
[2023-03-15 09:20:43] [INFO ] Deduced a trap composed of 150 places in 147 ms of which 0 ms to minimize.
[2023-03-15 09:20:43] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 1 ms to minimize.
[2023-03-15 09:20:44] [INFO ] Deduced a trap composed of 183 places in 146 ms of which 0 ms to minimize.
[2023-03-15 09:20:44] [INFO ] Deduced a trap composed of 174 places in 149 ms of which 1 ms to minimize.
[2023-03-15 09:20:44] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 0 ms to minimize.
[2023-03-15 09:20:44] [INFO ] Deduced a trap composed of 147 places in 139 ms of which 0 ms to minimize.
[2023-03-15 09:20:44] [INFO ] Deduced a trap composed of 162 places in 166 ms of which 0 ms to minimize.
[2023-03-15 09:20:44] [INFO ] Deduced a trap composed of 165 places in 166 ms of which 1 ms to minimize.
[2023-03-15 09:20:45] [INFO ] Deduced a trap composed of 171 places in 160 ms of which 0 ms to minimize.
[2023-03-15 09:20:45] [INFO ] Deduced a trap composed of 153 places in 169 ms of which 0 ms to minimize.
[2023-03-15 09:20:45] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:20:45] [INFO ] Deduced a trap composed of 177 places in 169 ms of which 4 ms to minimize.
[2023-03-15 09:20:45] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:20:46] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 0 ms to minimize.
[2023-03-15 09:20:46] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:20:46] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:20:46] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 1 ms to minimize.
[2023-03-15 09:20:47] [INFO ] Deduced a trap composed of 174 places in 146 ms of which 1 ms to minimize.
[2023-03-15 09:20:47] [INFO ] Deduced a trap composed of 153 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:20:47] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:20:47] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 3 ms to minimize.
[2023-03-15 09:20:47] [INFO ] Deduced a trap composed of 183 places in 146 ms of which 1 ms to minimize.
[2023-03-15 09:20:48] [INFO ] Deduced a trap composed of 183 places in 162 ms of which 0 ms to minimize.
[2023-03-15 09:20:48] [INFO ] Deduced a trap composed of 171 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:20:48] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 1 ms to minimize.
[2023-03-15 09:20:48] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 0 ms to minimize.
[2023-03-15 09:20:48] [INFO ] Deduced a trap composed of 174 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:20:49] [INFO ] Deduced a trap composed of 159 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:20:49] [INFO ] Deduced a trap composed of 171 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:20:49] [INFO ] Deduced a trap composed of 168 places in 141 ms of which 0 ms to minimize.
[2023-03-15 09:20:49] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 0 ms to minimize.
[2023-03-15 09:20:50] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:20:50] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 1 ms to minimize.
[2023-03-15 09:20:50] [INFO ] Deduced a trap composed of 150 places in 160 ms of which 0 ms to minimize.
[2023-03-15 09:20:50] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:20:50] [INFO ] Deduced a trap composed of 168 places in 152 ms of which 0 ms to minimize.
[2023-03-15 09:20:51] [INFO ] Deduced a trap composed of 177 places in 152 ms of which 0 ms to minimize.
[2023-03-15 09:20:51] [INFO ] Deduced a trap composed of 159 places in 151 ms of which 1 ms to minimize.
[2023-03-15 09:20:51] [INFO ] Deduced a trap composed of 153 places in 146 ms of which 0 ms to minimize.
[2023-03-15 09:20:51] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 1 ms to minimize.
[2023-03-15 09:20:52] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:20:52] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:20:52] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 1 ms to minimize.
[2023-03-15 09:20:52] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:20:52] [INFO ] Deduced a trap composed of 162 places in 152 ms of which 0 ms to minimize.
[2023-03-15 09:20:53] [INFO ] Deduced a trap composed of 159 places in 151 ms of which 1 ms to minimize.
[2023-03-15 09:20:53] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 0 ms to minimize.
[2023-03-15 09:20:53] [INFO ] Deduced a trap composed of 162 places in 149 ms of which 0 ms to minimize.
[2023-03-15 09:20:53] [INFO ] Deduced a trap composed of 159 places in 160 ms of which 0 ms to minimize.
[2023-03-15 09:20:53] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 1 ms to minimize.
[2023-03-15 09:20:54] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 1 ms to minimize.
[2023-03-15 09:20:54] [INFO ] Deduced a trap composed of 174 places in 144 ms of which 1 ms to minimize.
[2023-03-15 09:20:54] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 1 ms to minimize.
[2023-03-15 09:20:55] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 1 ms to minimize.
[2023-03-15 09:20:55] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 1 ms to minimize.
[2023-03-15 09:20:55] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 1 ms to minimize.
[2023-03-15 09:20:55] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 0 ms to minimize.
[2023-03-15 09:20:55] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 1 ms to minimize.
[2023-03-15 09:20:56] [INFO ] Deduced a trap composed of 159 places in 150 ms of which 0 ms to minimize.
[2023-03-15 09:20:56] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 1 ms to minimize.
[2023-03-15 09:20:56] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 1 ms to minimize.
[2023-03-15 09:20:56] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 1 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 0 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 162 places in 149 ms of which 1 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 0 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 162 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 165 places in 169 ms of which 1 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 171 places in 161 ms of which 1 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 153 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 0 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 0 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 1 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 1 ms to minimize.
[2023-03-15 09:21:01] [INFO ] Deduced a trap composed of 150 places in 143 ms of which 0 ms to minimize.
[2023-03-15 09:21:02] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 1 ms to minimize.
[2023-03-15 09:21:02] [INFO ] Deduced a trap composed of 156 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:21:03] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:21:03] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:21:03] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:21:03] [INFO ] Deduced a trap composed of 156 places in 164 ms of which 0 ms to minimize.
[2023-03-15 09:21:04] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 1 ms to minimize.
[2023-03-15 09:21:04] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 0 ms to minimize.
[2023-03-15 09:21:05] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 0 ms to minimize.
[2023-03-15 09:21:06] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 1 ms to minimize.
[2023-03-15 09:21:08] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 0 ms to minimize.
[2023-03-15 09:21:08] [INFO ] Deduced a trap composed of 171 places in 163 ms of which 1 ms to minimize.
[2023-03-15 09:21:08] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:21:09] [INFO ] Deduced a trap composed of 156 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:21:09] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 1 ms to minimize.
[2023-03-15 09:21:09] [INFO ] Deduced a trap composed of 156 places in 140 ms of which 1 ms to minimize.
[2023-03-15 09:21:09] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 0 ms to minimize.
[2023-03-15 09:21:10] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 0 ms to minimize.
[2023-03-15 09:21:10] [INFO ] Deduced a trap composed of 153 places in 159 ms of which 1 ms to minimize.
[2023-03-15 09:21:10] [INFO ] Deduced a trap composed of 153 places in 152 ms of which 0 ms to minimize.
[2023-03-15 09:21:10] [INFO ] Deduced a trap composed of 183 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:21:10] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:21:11] [INFO ] Deduced a trap composed of 150 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:21:11] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 1 ms to minimize.
[2023-03-15 09:21:12] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 1 ms to minimize.
[2023-03-15 09:21:13] [INFO ] Deduced a trap composed of 169 places in 150 ms of which 0 ms to minimize.
[2023-03-15 09:21:13] [INFO ] Deduced a trap composed of 153 places in 138 ms of which 1 ms to minimize.
[2023-03-15 09:21:13] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 0 ms to minimize.
[2023-03-15 09:21:14] [INFO ] Deduced a trap composed of 171 places in 141 ms of which 0 ms to minimize.
[2023-03-15 09:21:14] [INFO ] Deduced a trap composed of 168 places in 162 ms of which 1 ms to minimize.
[2023-03-15 09:21:14] [INFO ] Deduced a trap composed of 168 places in 165 ms of which 0 ms to minimize.
[2023-03-15 09:21:14] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:21:15] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 1 ms to minimize.
[2023-03-15 09:21:15] [INFO ] Deduced a trap composed of 177 places in 161 ms of which 0 ms to minimize.
[2023-03-15 09:21:16] [INFO ] Deduced a trap composed of 153 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:21:18] [INFO ] Deduced a trap composed of 162 places in 164 ms of which 1 ms to minimize.
[2023-03-15 09:21:18] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 0 ms to minimize.
[2023-03-15 09:21:21] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:21:22] [INFO ] Deduced a trap composed of 159 places in 163 ms of which 1 ms to minimize.
[2023-03-15 09:21:22] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 1 ms to minimize.
[2023-03-15 09:21:22] [INFO ] Deduced a trap composed of 183 places in 164 ms of which 0 ms to minimize.
[2023-03-15 09:21:23] [INFO ] Deduced a trap composed of 165 places in 170 ms of which 1 ms to minimize.
[2023-03-15 09:21:25] [INFO ] Deduced a trap composed of 177 places in 160 ms of which 0 ms to minimize.
[2023-03-15 09:21:34] [INFO ] Trap strengthening (SAT) tested/added 120/120 trap constraints in 50966 ms
[2023-03-15 09:21:34] [INFO ] After 51419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:21:34] [INFO ] After 51539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:21:34] [INFO ] Flatten gal took : 42 ms
[2023-03-15 09:21:34] [INFO ] Flatten gal took : 41 ms
[2023-03-15 09:21:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12637922473604253111.gal : 5 ms
[2023-03-15 09:21:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13368443352197553511.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12637922473604253111.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13368443352197553511.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality13368443352197553511.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :21 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31 after 33
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :33 after 37
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :37 after 51
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :51 after 95
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :95 after 1501
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1501 after 1759
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1759 after 2570
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2570 after 3664
Detected timeout of ITS tools.
[2023-03-15 09:21:49] [INFO ] Flatten gal took : 70 ms
[2023-03-15 09:21:49] [INFO ] Applying decomposition
[2023-03-15 09:21:49] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6679355847296439527.txt' '-o' '/tmp/graph6679355847296439527.bin' '-w' '/tmp/graph6679355847296439527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6679355847296439527.bin' '-l' '-1' '-v' '-w' '/tmp/graph6679355847296439527.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:21:49] [INFO ] Decomposing Gal with order
[2023-03-15 09:21:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:21:50] [INFO ] Removed a total of 944 redundant transitions.
[2023-03-15 09:21:50] [INFO ] Flatten gal took : 227 ms
[2023-03-15 09:21:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 213 labels/synchronizations in 51 ms.
[2023-03-15 09:21:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11273805200290719102.gal : 18 ms
[2023-03-15 09:21:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17270887927444151314.prop : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11273805200290719102.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17270887927444151314.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality17270887927444151314.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12378431424656334438
[2023-03-15 09:22:05] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12378431424656334438
Running compilation step : cd /tmp/ltsmin12378431424656334438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1273 ms.
Running link step : cd /tmp/ltsmin12378431424656334438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12378431424656334438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 09:22:20] [INFO ] Flatten gal took : 35 ms
[2023-03-15 09:22:20] [INFO ] Flatten gal took : 33 ms
[2023-03-15 09:22:20] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11764512051017242558.gal : 4 ms
[2023-03-15 09:22:20] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2680697468413580580.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability11764512051017242558.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2680697468413580580.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityFireability2680697468413580580.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 25
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :25 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 46
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :46 after 474
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :474 after 721
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :721 after 1025
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1025 after 1888
Detected timeout of ITS tools.
[2023-03-15 09:22:23] [INFO ] Flatten gal took : 31 ms
[2023-03-15 09:22:23] [INFO ] Applying decomposition
[2023-03-15 09:22:23] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16426217163992699160.txt' '-o' '/tmp/graph16426217163992699160.bin' '-w' '/tmp/graph16426217163992699160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16426217163992699160.bin' '-l' '-1' '-v' '-w' '/tmp/graph16426217163992699160.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:22:23] [INFO ] Decomposing Gal with order
[2023-03-15 09:22:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:22:23] [INFO ] Removed a total of 724 redundant transitions.
[2023-03-15 09:22:23] [INFO ] Flatten gal took : 81 ms
[2023-03-15 09:22:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 205 labels/synchronizations in 17 ms.
[2023-03-15 09:22:23] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5957495460046981668.gal : 6 ms
[2023-03-15 09:22:23] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability649952899644287093.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5957495460046981668.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability649952899644287093.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/ReachabilityFireability649952899644287093.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 58692
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :58692 after 58710
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :58710 after 62857
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :62857 after 71410
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :71410 after 80785
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :80785 after 2.24186e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14332296826713566361
[2023-03-15 09:22:26] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14332296826713566361
Running compilation step : cd /tmp/ltsmin14332296826713566361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1345 ms.
Running link step : cd /tmp/ltsmin14332296826713566361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14332296826713566361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 09:22:29] [INFO ] Flatten gal took : 30 ms
[2023-03-15 09:22:29] [INFO ] Flatten gal took : 30 ms
[2023-03-15 09:22:29] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2401025975723962260.gal : 4 ms
[2023-03-15 09:22:29] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability240626852598565516.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability2401025975723962260.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability240626852598565516.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityFireability240626852598565516.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 25
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :25 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 46
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :46 after 474
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :474 after 721
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :721 after 1025
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1025 after 1888
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1888 after 3474
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3474 after 8076
Detected timeout of ITS tools.
[2023-03-15 09:22:59] [INFO ] Flatten gal took : 28 ms
[2023-03-15 09:22:59] [INFO ] Applying decomposition
[2023-03-15 09:23:00] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14753106092460645263.txt' '-o' '/tmp/graph14753106092460645263.bin' '-w' '/tmp/graph14753106092460645263.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14753106092460645263.bin' '-l' '-1' '-v' '-w' '/tmp/graph14753106092460645263.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:23:00] [INFO ] Decomposing Gal with order
[2023-03-15 09:23:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:23:00] [INFO ] Removed a total of 724 redundant transitions.
[2023-03-15 09:23:00] [INFO ] Flatten gal took : 118 ms
[2023-03-15 09:23:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 333 labels/synchronizations in 22 ms.
[2023-03-15 09:23:00] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13289554792251506717.gal : 7 ms
[2023-03-15 09:23:00] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17007899909590119417.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability13289554792251506717.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17007899909590119417.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityFireability17007899909590119417.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 99
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :99 after 166
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :166 after 202
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :202 after 277
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :277 after 341
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :341 after 580
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :580 after 1.13627e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9585324374985609130
[2023-03-15 09:23:30] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9585324374985609130
Running compilation step : cd /tmp/ltsmin9585324374985609130;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1290 ms.
Running link step : cd /tmp/ltsmin9585324374985609130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9585324374985609130;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 09:24:00] [INFO ] Flatten gal took : 35 ms
[2023-03-15 09:24:00] [INFO ] Flatten gal took : 30 ms
[2023-03-15 09:24:00] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5520718616658178640.gal : 5 ms
[2023-03-15 09:24:00] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2165845430815799476.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5520718616658178640.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2165845430815799476.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityFireability2165845430815799476.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 25
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :25 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 46
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :46 after 474
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :474 after 721
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :721 after 1025
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1025 after 1888
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1888 after 3474
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3474 after 8076
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8076 after 59572
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :59572 after 188478
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :188478 after 447244
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :447244 after 2.93943e+06
Detected timeout of ITS tools.
[2023-03-15 09:29:00] [INFO ] Flatten gal took : 29 ms
[2023-03-15 09:29:00] [INFO ] Applying decomposition
[2023-03-15 09:29:00] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18110394494275952783.txt' '-o' '/tmp/graph18110394494275952783.bin' '-w' '/tmp/graph18110394494275952783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18110394494275952783.bin' '-l' '-1' '-v' '-w' '/tmp/graph18110394494275952783.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:29:00] [INFO ] Decomposing Gal with order
[2023-03-15 09:29:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:29:00] [INFO ] Removed a total of 724 redundant transitions.
[2023-03-15 09:29:00] [INFO ] Flatten gal took : 74 ms
[2023-03-15 09:29:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 209 labels/synchronizations in 13 ms.
[2023-03-15 09:29:00] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10037524583602992398.gal : 6 ms
[2023-03-15 09:29:00] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4658983894322858405.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10037524583602992398.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4658983894322858405.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability4658983894322858405.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 66
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :66 after 68
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :68 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 166
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :166 after 394
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :394 after 1.976e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.976e+06 after 1.976e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.976e+06 after 3.23763e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7706003884285533191
[2023-03-15 09:34:01] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7706003884285533191
Running compilation step : cd /tmp/ltsmin7706003884285533191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1239 ms.
Running link step : cd /tmp/ltsmin7706003884285533191;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7706003884285533191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.014: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.015: There are 747 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.015: State length is 530, there are 746 groups
pins2lts-mc-linux64( 0/ 8), 0.016: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.016: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.016: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.016: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.013: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.014: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.015: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.014: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.014: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.015: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 6.451: ~4 levels ~960 states ~1280 transitions
pins2lts-mc-linux64( 7/ 8), 6.511: ~7 levels ~1920 states ~6576 transitions
pins2lts-mc-linux64( 7/ 8), 6.592: ~8 levels ~3840 states ~13168 transitions
pins2lts-mc-linux64( 7/ 8), 6.693: ~10 levels ~7680 states ~23728 transitions
pins2lts-mc-linux64( 6/ 8), 6.898: ~10 levels ~15360 states ~46328 transitions
pins2lts-mc-linux64( 4/ 8), 7.488: ~6 levels ~30720 states ~128624 transitions
pins2lts-mc-linux64( 4/ 8), 8.201: ~7 levels ~61440 states ~210088 transitions
pins2lts-mc-linux64( 4/ 8), 9.303: ~10 levels ~122880 states ~291592 transitions
pins2lts-mc-linux64( 4/ 8), 11.380: ~14 levels ~245760 states ~633272 transitions
pins2lts-mc-linux64( 4/ 8), 16.486: ~20 levels ~491520 states ~1167184 transitions
pins2lts-mc-linux64( 4/ 8), 26.300: ~41 levels ~983040 states ~4532200 transitions
pins2lts-mc-linux64( 7/ 8), 41.972: ~38 levels ~1966080 states ~4966576 transitions
pins2lts-mc-linux64( 7/ 8), 70.800: ~44 levels ~3932160 states ~8535296 transitions
pins2lts-mc-linux64( 7/ 8), 134.780: ~87 levels ~7864320 states ~18916328 transitions
pins2lts-mc-linux64( 3/ 8), 264.281: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 264.947:
pins2lts-mc-linux64( 0/ 8), 264.947: mean standard work distribution: 21.7% (states) 80.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 264.947:
pins2lts-mc-linux64( 0/ 8), 264.947: Explored 11440594 states 99127712 transitions, fanout: 8.665
pins2lts-mc-linux64( 0/ 8), 264.947: Total exploration time 264.920 sec (264.260 sec minimum, 264.466 sec on average)
pins2lts-mc-linux64( 0/ 8), 264.947: States per second: 43185, Transitions per second: 374180
pins2lts-mc-linux64( 0/ 8), 264.947:
pins2lts-mc-linux64( 0/ 8), 264.947: Queue width: 8B, total height: 23242620, memory: 177.33MB
pins2lts-mc-linux64( 0/ 8), 264.947: Tree memory: 518.4MB, 15.8 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 264.947: Tree fill ratio (roots/leafs): 25.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 264.947: Stored 753 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 264.947: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 264.947: Est. total memory use: 695.7MB (~1201.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7706003884285533191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7706003884285533191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2023-03-15 09:38:27] [INFO ] Flatten gal took : 32 ms
[2023-03-15 09:38:27] [INFO ] Flatten gal took : 30 ms
[2023-03-15 09:38:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9697725339413534317.gal : 3 ms
[2023-03-15 09:38:27] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9249588389715906477.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9697725339413534317.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9249588389715906477.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityFireability9249588389715906477.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 25
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :25 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 46
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :46 after 474
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :474 after 721
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :721 after 1025
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1025 after 1888
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1888 after 3474
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3474 after 8076
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8076 after 59572
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :59572 after 188478
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :188478 after 447244
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :447244 after 2.93943e+06

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 gold2022"
echo " Input is PolyORBNT-COL-S05J40, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r320-tall-167873970600407"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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