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.r307-tall-167873961400422.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 itstools
Input is PolyORBNT-COL-S10J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tall-167873961400422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 01:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 02:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:37 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 92K 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 1678866441026

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J20
Not applying reductions.
Model is COL
QuasiLiveness COL
Running Version 202303021504
[2023-03-15 07:47:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 07:47:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:47:22] [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 07:47:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 07:47:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 705 ms
[2023-03-15 07:47:23] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 19 ms.
[2023-03-15 07:47:23] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 199 ms.
[2023-03-15 07:47:23] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 07:47:23] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 07:47:23] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 07:47:23] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 20 places in 31 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
[2023-03-15 07:47:24] [INFO ] Flatten gal took : 455 ms
[2023-03-15 07:47:24] [INFO ] Flatten gal took : 264 ms
[2023-03-15 07:47:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1358952670585917544.gal : 70 ms
[2023-03-15 07:47:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10422238190516329481.prop : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1358952670585917544.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10422238190516329481.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete random walk after 10000 steps, including 562 resets, run finished after 1424 ms. (steps per millisecond=7 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Loading property file /tmp/ReachabilityCardinality10422238190516329481.prop.
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-15 07:47:25] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2023-03-15 07:47:25] [INFO ] Computed 72 place invariants in 81 ms
Reachability property qltransition_31 is true.
SDD proceeding with computation,35 properties remain. new max is 2
SDD size :1 after 2
Reachability property qltransition_35 is true.
Reachability property qltransition_32 is true.
Reachability property qltransition_16 is true.
SDD proceeding with computation,32 properties remain. new max is 2
SDD size :2 after 5
SDD proceeding with computation,32 properties remain. new max is 4
SDD size :5 after 6
Reachability property qltransition_27 is true.
Reachability property qltransition_20 is true.
Reachability property qltransition_15 is true.
SDD proceeding with computation,29 properties remain. new max is 4
SDD size :6 after 14
Reachability property qltransition_21 is true.
SDD proceeding with computation,28 properties remain. new max is 4
SDD size :14 after 15
Reachability property qltransition_25 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_6 is true.
Reachability property qltransition_5 is true.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :15 after 19
Reachability property qltransition_14 is true.
SDD proceeding with computation,23 properties remain. new max is 4
SDD size :19 after 20
Reachability property qltransition_9 is true.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :20 after 21
Reachability property qltransition_36 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_8 is true.
SDD proceeding with computation,19 properties remain. new max is 4
SDD size :21 after 24
Reachability property qltransition_30 is true.
SDD proceeding with computation,18 properties remain. new max is 4
SDD size :24 after 26
Reachability property qltransition_28 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :26 after 28
Reachability property qltransition_34 is true.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :28 after 29
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :29 after 33
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :33 after 34
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :34 after 38
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :38 after 42
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :42 after 47
[2023-03-15 07:47:27] [INFO ] [Real]Absence check using 65 positive place invariants in 19 ms returned sat
[2023-03-15 07:47:27] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :47 after 56
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :56 after 71
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :71 after 103
[2023-03-15 07:47:28] [INFO ] After 755ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2023-03-15 07:47:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:47:28] [INFO ] After 104ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:6
Reachability property qltransition_33 is true.
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :103 after 164
[2023-03-15 07:47:28] [INFO ] After 310ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:6
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-15 07:47:28] [INFO ] After 1689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:6
[2023-03-15 07:47:28] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-15 07:47:28] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 16 ms returned sat
Reachability property qltransition_24 is true.
Reachability property qltransition_19 is true.
Reachability property qltransition_4 is true.
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :164 after 368
Reachability property qltransition_13 is true.
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :368 after 638
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :638 after 979
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :979 after 1545
[2023-03-15 07:47:31] [INFO ] After 2351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-15 07:47:31] [INFO ] After 780ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :1545 after 2760
[2023-03-15 07:47:33] [INFO ] Deduced a trap composed of 218 places in 402 ms of which 0 ms to minimize.
[2023-03-15 07:47:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 560 ms
[2023-03-15 07:47:33] [INFO ] Deduced a trap composed of 132 places in 371 ms of which 1 ms to minimize.
[2023-03-15 07:47:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2023-03-15 07:47:33] [INFO ] After 2773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 739 ms.
[2023-03-15 07:47:34] [INFO ] After 6112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 1045 ms.
Support contains 39 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 464 transition count 1625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 60 place count 439 transition count 1625
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 60 place count 439 transition count 1602
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 106 place count 416 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 415 transition count 1601
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 415 transition count 1601
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 112 place count 413 transition count 1599
Applied a total of 112 rules in 218 ms. Remains 413 /474 variables (removed 61) and now considering 1599/1650 (removed 51) transitions.
[2023-03-15 07:47:35] [INFO ] Flow matrix only has 1590 transitions (discarded 9 similar events)
// Phase 1: matrix 1590 rows 413 cols
[2023-03-15 07:47:35] [INFO ] Computed 62 place invariants in 36 ms
[2023-03-15 07:47:36] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 413/474 places, 984/1650 transitions.
Applied a total of 0 rules in 29 ms. Remains 413 /413 variables (removed 0) and now considering 984/984 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 871 ms. Remains : 413/474 places, 984/1650 transitions.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :2760 after 5155
Incomplete random walk after 1000000 steps, including 65305 resets, run finished after 6187 ms. (steps per millisecond=161 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9508 resets, run finished after 1402 ms. (steps per millisecond=713 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:47:44] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2023-03-15 07:47:44] [INFO ] Computed 62 place invariants in 18 ms
[2023-03-15 07:47:44] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 07:47:44] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 07:47:44] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:47:44] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2023-03-15 07:47:44] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 07:47:44] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:47:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:47:44] [INFO ] After 81ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 1 ms to minimize.
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:47:46] [INFO ] Deduced a trap composed of 172 places in 227 ms of which 1 ms to minimize.
[2023-03-15 07:47:46] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 1 ms to minimize.
[2023-03-15 07:47:46] [INFO ] Deduced a trap composed of 168 places in 256 ms of which 1 ms to minimize.
[2023-03-15 07:47:46] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:47:47] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:47:47] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 0 ms to minimize.
[2023-03-15 07:47:47] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 1 ms to minimize.
[2023-03-15 07:47:47] [INFO ] Deduced a trap composed of 172 places in 211 ms of which 1 ms to minimize.
[2023-03-15 07:47:48] [INFO ] Deduced a trap composed of 176 places in 209 ms of which 1 ms to minimize.
[2023-03-15 07:47:48] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-15 07:47:48] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:47:48] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:47:49] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:47:49] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 1 ms to minimize.
[2023-03-15 07:47:49] [INFO ] Deduced a trap composed of 172 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:47:50] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 0 ms to minimize.
[2023-03-15 07:47:50] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 0 ms to minimize.
[2023-03-15 07:47:50] [INFO ] Deduced a trap composed of 172 places in 233 ms of which 0 ms to minimize.
Reachability property qltransition_23 is true.
Reachability property qltransition_18 is true.
[2023-03-15 07:47:51] [INFO ] Deduced a trap composed of 164 places in 250 ms of which 1 ms to minimize.
[2023-03-15 07:47:51] [INFO ] Deduced a trap composed of 162 places in 246 ms of which 1 ms to minimize.
Reachability property qltransition_12 is true.
[2023-03-15 07:47:51] [INFO ] Deduced a trap composed of 168 places in 222 ms of which 1 ms to minimize.
Reachability property qltransition_0 is true.
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :5155 after 15831
[2023-03-15 07:47:51] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 0 ms to minimize.
[2023-03-15 07:47:52] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 07:47:52] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:47:52] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 1 ms to minimize.
[2023-03-15 07:47:52] [INFO ] Deduced a trap composed of 159 places in 235 ms of which 5 ms to minimize.
[2023-03-15 07:47:53] [INFO ] Deduced a trap composed of 170 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:47:53] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:47:53] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:47:54] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:47:54] [INFO ] Deduced a trap composed of 168 places in 229 ms of which 2 ms to minimize.
[2023-03-15 07:47:54] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 2 ms to minimize.
[2023-03-15 07:47:55] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 1 ms to minimize.
[2023-03-15 07:47:55] [INFO ] Deduced a trap composed of 156 places in 240 ms of which 1 ms to minimize.
[2023-03-15 07:47:55] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 0 ms to minimize.
[2023-03-15 07:47:55] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 0 ms to minimize.
[2023-03-15 07:47:56] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2023-03-15 07:47:56] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:47:56] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:47:57] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 0 ms to minimize.
[2023-03-15 07:47:57] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 1 ms to minimize.
[2023-03-15 07:47:57] [INFO ] Deduced a trap composed of 168 places in 220 ms of which 0 ms to minimize.
[2023-03-15 07:47:58] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2023-03-15 07:47:58] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:47:58] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :15831 after 64843
[2023-03-15 07:47:58] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 0 ms to minimize.
[2023-03-15 07:47:59] [INFO ] Deduced a trap composed of 168 places in 228 ms of which 0 ms to minimize.
[2023-03-15 07:47:59] [INFO ] Deduced a trap composed of 162 places in 246 ms of which 15 ms to minimize.
[2023-03-15 07:47:59] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:48:00] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2023-03-15 07:48:00] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 07:48:00] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 1 ms to minimize.
[2023-03-15 07:48:01] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:48:01] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2023-03-15 07:48:02] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 0 ms to minimize.
[2023-03-15 07:48:02] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 2 ms to minimize.
[2023-03-15 07:48:03] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 1 ms to minimize.
[2023-03-15 07:48:03] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 0 ms to minimize.
[2023-03-15 07:48:03] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 1 ms to minimize.
[2023-03-15 07:48:04] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 14 ms to minimize.
[2023-03-15 07:48:10] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 2 ms to minimize.
[2023-03-15 07:48:11] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:48:11] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 0 ms to minimize.
[2023-03-15 07:48:11] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 1 ms to minimize.
[2023-03-15 07:48:12] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 1 ms to minimize.
[2023-03-15 07:48:13] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-15 07:48:13] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :64843 after 164753
[2023-03-15 07:48:14] [INFO ] Deduced a trap composed of 172 places in 212 ms of which 0 ms to minimize.
[2023-03-15 07:48:14] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 0 ms to minimize.
[2023-03-15 07:48:23] [INFO ] Trap strengthening (SAT) tested/added 73/73 trap constraints in 38499 ms
[2023-03-15 07:48:23] [INFO ] After 38608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:48:23] [INFO ] After 39003ms 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 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 984/984 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 413 transition count 983
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 412 transition count 983
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 412 transition count 981
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 6 place count 410 transition count 981
Applied a total of 6 rules in 84 ms. Remains 410 /413 variables (removed 3) and now considering 981/984 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 410/413 places, 981/984 transitions.
Incomplete random walk after 1000000 steps, including 72960 resets, run finished after 8719 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9600 resets, run finished after 1682 ms. (steps per millisecond=594 ) properties (out of 1) seen :0
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :164753 after 364928
Interrupted probabilistic random walk after 6157014 steps, run timeout after 30001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 6157014 steps, saw 1069361 distinct states, run finished after 30003 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:49:03] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 07:49:03] [INFO ] Computed 62 place invariants in 32 ms
[2023-03-15 07:49:03] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 07:49:03] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 07:49:03] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:49:04] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 07:49:04] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 07:49:04] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:49:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:49:04] [INFO ] After 63ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:49:04] [INFO ] Deduced a trap composed of 167 places in 212 ms of which 1 ms to minimize.
[2023-03-15 07:49:04] [INFO ] Deduced a trap composed of 175 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:49:05] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 0 ms to minimize.
[2023-03-15 07:49:05] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 1 ms to minimize.
[2023-03-15 07:49:05] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 1 ms to minimize.
[2023-03-15 07:49:05] [INFO ] Deduced a trap composed of 173 places in 230 ms of which 1 ms to minimize.
[2023-03-15 07:49:06] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 0 ms to minimize.
[2023-03-15 07:49:06] [INFO ] Deduced a trap composed of 175 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:49:06] [INFO ] Deduced a trap composed of 179 places in 224 ms of which 1 ms to minimize.
[2023-03-15 07:49:07] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:49:07] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 0 ms to minimize.
[2023-03-15 07:49:07] [INFO ] Deduced a trap composed of 177 places in 241 ms of which 1 ms to minimize.
[2023-03-15 07:49:07] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:49:08] [INFO ] Deduced a trap composed of 166 places in 240 ms of which 0 ms to minimize.
[2023-03-15 07:49:08] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 1 ms to minimize.
[2023-03-15 07:49:08] [INFO ] Deduced a trap composed of 175 places in 203 ms of which 0 ms to minimize.
[2023-03-15 07:49:08] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 0 ms to minimize.
[2023-03-15 07:49:09] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 1 ms to minimize.
[2023-03-15 07:49:09] [INFO ] Deduced a trap composed of 173 places in 219 ms of which 0 ms to minimize.
[2023-03-15 07:49:09] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2023-03-15 07:49:09] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:49:10] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:49:10] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 0 ms to minimize.
[2023-03-15 07:49:10] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 1 ms to minimize.
[2023-03-15 07:49:11] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 0 ms to minimize.
[2023-03-15 07:49:11] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 1 ms to minimize.
[2023-03-15 07:49:11] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2023-03-15 07:49:12] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 1 ms to minimize.
[2023-03-15 07:49:12] [INFO ] Deduced a trap composed of 156 places in 209 ms of which 1 ms to minimize.
[2023-03-15 07:49:12] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 1 ms to minimize.
[2023-03-15 07:49:13] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 0 ms to minimize.
[2023-03-15 07:49:13] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2023-03-15 07:49:13] [INFO ] Deduced a trap composed of 173 places in 216 ms of which 0 ms to minimize.
[2023-03-15 07:49:14] [INFO ] Deduced a trap composed of 181 places in 215 ms of which 0 ms to minimize.
[2023-03-15 07:49:14] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 1 ms to minimize.
[2023-03-15 07:49:14] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:49:14] [INFO ] Deduced a trap composed of 175 places in 214 ms of which 1 ms to minimize.
[2023-03-15 07:49:15] [INFO ] Deduced a trap composed of 169 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:49:15] [INFO ] Deduced a trap composed of 175 places in 238 ms of which 0 ms to minimize.
[2023-03-15 07:49:16] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 0 ms to minimize.
[2023-03-15 07:49:16] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:49:16] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-15 07:49:16] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 1 ms to minimize.
[2023-03-15 07:49:17] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 1 ms to minimize.
[2023-03-15 07:49:17] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 0 ms to minimize.
[2023-03-15 07:49:17] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 1 ms to minimize.
[2023-03-15 07:49:17] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 0 ms to minimize.
[2023-03-15 07:49:18] [INFO ] Deduced a trap composed of 158 places in 237 ms of which 0 ms to minimize.
[2023-03-15 07:49:18] [INFO ] Deduced a trap composed of 154 places in 202 ms of which 0 ms to minimize.
[2023-03-15 07:49:18] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-15 07:49:18] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-15 07:49:19] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 0 ms to minimize.
[2023-03-15 07:49:19] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 0 ms to minimize.
[2023-03-15 07:49:19] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 1 ms to minimize.
[2023-03-15 07:49:20] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:49:20] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-15 07:49:20] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 0 ms to minimize.
[2023-03-15 07:49:21] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 0 ms to minimize.
[2023-03-15 07:49:22] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 1 ms to minimize.
[2023-03-15 07:49:22] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 0 ms to minimize.
[2023-03-15 07:49:23] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-15 07:49:23] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 0 ms to minimize.
[2023-03-15 07:49:23] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 0 ms to minimize.
[2023-03-15 07:49:24] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:49:24] [INFO ] Deduced a trap composed of 154 places in 221 ms of which 1 ms to minimize.
[2023-03-15 07:49:24] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 1 ms to minimize.
[2023-03-15 07:49:25] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 1 ms to minimize.
[2023-03-15 07:49:25] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 1 ms to minimize.
[2023-03-15 07:49:25] [INFO ] Deduced a trap composed of 170 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:49:26] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 1 ms to minimize.
[2023-03-15 07:49:26] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:49:26] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:49:27] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 1 ms to minimize.
[2023-03-15 07:49:29] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:49:30] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 1 ms to minimize.
[2023-03-15 07:49:30] [INFO ] Deduced a trap composed of 173 places in 227 ms of which 1 ms to minimize.
[2023-03-15 07:49:30] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 1 ms to minimize.
[2023-03-15 07:49:31] [INFO ] Deduced a trap composed of 170 places in 232 ms of which 1 ms to minimize.
[2023-03-15 07:49:31] [INFO ] Deduced a trap composed of 154 places in 233 ms of which 1 ms to minimize.
[2023-03-15 07:49:31] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 0 ms to minimize.
[2023-03-15 07:49:32] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 0 ms to minimize.
[2023-03-15 07:49:32] [INFO ] Deduced a trap composed of 170 places in 228 ms of which 1 ms to minimize.
[2023-03-15 07:49:33] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:49:33] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 0 ms to minimize.
[2023-03-15 07:49:33] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 0 ms to minimize.
[2023-03-15 07:49:34] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:49:34] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:49:34] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:49:35] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:49:35] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 1 ms to minimize.
[2023-03-15 07:49:36] [INFO ] Deduced a trap composed of 164 places in 233 ms of which 1 ms to minimize.
[2023-03-15 07:49:36] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 1 ms to minimize.
[2023-03-15 07:49:36] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 1 ms to minimize.
[2023-03-15 07:49:38] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 0 ms to minimize.
[2023-03-15 07:49:38] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:49:38] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:49:39] [INFO ] Deduced a trap composed of 179 places in 226 ms of which 0 ms to minimize.
[2023-03-15 07:49:39] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 0 ms to minimize.
[2023-03-15 07:49:40] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 1 ms to minimize.
[2023-03-15 07:49:40] [INFO ] Deduced a trap composed of 173 places in 227 ms of which 0 ms to minimize.
[2023-03-15 07:49:40] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:49:41] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 07:49:44] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:49:45] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2023-03-15 07:49:47] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 0 ms to minimize.
[2023-03-15 07:49:56] [INFO ] Trap strengthening (SAT) tested/added 105/105 trap constraints in 52033 ms
[2023-03-15 07:49:56] [INFO ] After 52154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:49:56] [INFO ] After 52558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 45 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 40 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 07:49:56] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:49:56] [INFO ] Invariant cache hit.
[2023-03-15 07:49:57] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-15 07:49:57] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:49:57] [INFO ] Invariant cache hit.
[2023-03-15 07:49:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:49:59] [INFO ] Implicit Places using invariants and state equation in 2186 ms returned []
Implicit Place search using SMT with State Equation took 2702 ms to find 0 implicit places.
[2023-03-15 07:49:59] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-15 07:49:59] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:49:59] [INFO ] Invariant cache hit.
[2023-03-15 07:49:59] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3212 ms. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 100000 steps, including 7313 resets, run finished after 1114 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:50:00] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:50:00] [INFO ] Invariant cache hit.
[2023-03-15 07:50:00] [INFO ] [Real]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-15 07:50:00] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 07:50:01] [INFO ] After 213ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:50:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:50:01] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 07:50:01] [INFO ] Deduced a trap composed of 169 places in 212 ms of which 1 ms to minimize.
[2023-03-15 07:50:01] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 1 ms to minimize.
[2023-03-15 07:50:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 523 ms
[2023-03-15 07:50:01] [INFO ] After 577ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:50:01] [INFO ] After 869ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:50:01] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 07:50:01] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 07:50:02] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:50:02] [INFO ] After 181ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:50:02] [INFO ] Deduced a trap composed of 174 places in 239 ms of which 1 ms to minimize.
[2023-03-15 07:50:02] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2023-03-15 07:50:02] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 0 ms to minimize.
[2023-03-15 07:50:03] [INFO ] Deduced a trap composed of 174 places in 200 ms of which 0 ms to minimize.
[2023-03-15 07:50:03] [INFO ] Deduced a trap composed of 172 places in 198 ms of which 1 ms to minimize.
[2023-03-15 07:50:03] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2023-03-15 07:50:03] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2023-03-15 07:50:04] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2023-03-15 07:50:04] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 1 ms to minimize.
[2023-03-15 07:50:04] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 0 ms to minimize.
[2023-03-15 07:50:04] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-15 07:50:05] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 1 ms to minimize.
[2023-03-15 07:50:05] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:50:05] [INFO ] Deduced a trap composed of 156 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:50:06] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-15 07:50:06] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-15 07:50:06] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-15 07:50:06] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 07:50:06] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-15 07:50:07] [INFO ] Deduced a trap composed of 158 places in 232 ms of which 1 ms to minimize.
[2023-03-15 07:50:07] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:50:07] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 0 ms to minimize.
[2023-03-15 07:50:08] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:50:08] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 1 ms to minimize.
[2023-03-15 07:50:08] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:50:09] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:50:09] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2023-03-15 07:50:09] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 1 ms to minimize.
[2023-03-15 07:50:09] [INFO ] Deduced a trap composed of 168 places in 239 ms of which 0 ms to minimize.
[2023-03-15 07:50:10] [INFO ] Deduced a trap composed of 175 places in 196 ms of which 1 ms to minimize.
[2023-03-15 07:50:10] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2023-03-15 07:50:10] [INFO ] Deduced a trap composed of 169 places in 235 ms of which 0 ms to minimize.
[2023-03-15 07:50:11] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 1 ms to minimize.
[2023-03-15 07:50:12] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:50:12] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 0 ms to minimize.
[2023-03-15 07:50:12] [INFO ] Deduced a trap composed of 154 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:50:13] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 1 ms to minimize.
[2023-03-15 07:50:13] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:50:13] [INFO ] Deduced a trap composed of 156 places in 228 ms of which 0 ms to minimize.
[2023-03-15 07:50:14] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:50:14] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 1 ms to minimize.
[2023-03-15 07:50:14] [INFO ] Deduced a trap composed of 156 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:50:14] [INFO ] Deduced a trap composed of 168 places in 227 ms of which 0 ms to minimize.
[2023-03-15 07:50:15] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 0 ms to minimize.
[2023-03-15 07:50:15] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 1 ms to minimize.
[2023-03-15 07:50:15] [INFO ] Deduced a trap composed of 156 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:50:16] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 1 ms to minimize.
[2023-03-15 07:50:16] [INFO ] Deduced a trap composed of 152 places in 226 ms of which 3 ms to minimize.
[2023-03-15 07:50:16] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2023-03-15 07:50:17] [INFO ] Deduced a trap composed of 158 places in 237 ms of which 0 ms to minimize.
[2023-03-15 07:50:17] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 0 ms to minimize.
[2023-03-15 07:50:18] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 0 ms to minimize.
[2023-03-15 07:50:18] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:50:18] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 1 ms to minimize.
[2023-03-15 07:50:18] [INFO ] Deduced a trap composed of 156 places in 229 ms of which 0 ms to minimize.
[2023-03-15 07:50:19] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:50:19] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:50:20] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2023-03-15 07:50:20] [INFO ] Deduced a trap composed of 154 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:50:20] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:50:21] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 1 ms to minimize.
[2023-03-15 07:50:21] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 1 ms to minimize.
[2023-03-15 07:50:21] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 1 ms to minimize.
[2023-03-15 07:50:21] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 1 ms to minimize.
[2023-03-15 07:50:22] [INFO ] Deduced a trap composed of 162 places in 238 ms of which 2 ms to minimize.
[2023-03-15 07:50:22] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:50:22] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 1 ms to minimize.
[2023-03-15 07:50:23] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:50:23] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:50:23] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 0 ms to minimize.
[2023-03-15 07:50:24] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 1 ms to minimize.
[2023-03-15 07:50:24] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 4 ms to minimize.
[2023-03-15 07:50:24] [INFO ] Deduced a trap composed of 173 places in 222 ms of which 1 ms to minimize.
[2023-03-15 07:50:25] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 0 ms to minimize.
[2023-03-15 07:50:25] [INFO ] Deduced a trap composed of 168 places in 227 ms of which 0 ms to minimize.
[2023-03-15 07:50:25] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:50:26] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:50:26] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 1 ms to minimize.
[2023-03-15 07:50:26] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-15 07:50:27] [INFO ] Deduced a trap composed of 160 places in 262 ms of which 1 ms to minimize.
Reachability property qltransition_22 is true.
[2023-03-15 07:50:27] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 1 ms to minimize.
[2023-03-15 07:50:27] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 0 ms to minimize.
[2023-03-15 07:50:28] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:50:28] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 1 ms to minimize.
[2023-03-15 07:50:28] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 0 ms to minimize.
[2023-03-15 07:50:29] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:50:29] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
Reachability property qltransition_17 is true.
[2023-03-15 07:50:30] [INFO ] Deduced a trap composed of 158 places in 250 ms of which 0 ms to minimize.
[2023-03-15 07:50:30] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:50:30] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 1 ms to minimize.
[2023-03-15 07:50:30] [INFO ] Deduced a trap composed of 170 places in 229 ms of which 0 ms to minimize.
[2023-03-15 07:50:31] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 1 ms to minimize.
[2023-03-15 07:50:31] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 1 ms to minimize.
[2023-03-15 07:50:31] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 0 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 131072
[2023-03-15 07:50:32] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
SDD size :364928 after 4.10765e+06
[2023-03-15 07:50:33] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-15 07:50:34] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 1 ms to minimize.
[2023-03-15 07:50:34] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2023-03-15 07:50:37] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2023-03-15 07:50:38] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 1 ms to minimize.
[2023-03-15 07:50:38] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 1 ms to minimize.
[2023-03-15 07:50:38] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 1 ms to minimize.
[2023-03-15 07:50:39] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-15 07:50:39] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 0 ms to minimize.
[2023-03-15 07:50:41] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 0 ms to minimize.
[2023-03-15 07:50:42] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 0 ms to minimize.
[2023-03-15 07:50:42] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2023-03-15 07:50:43] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2023-03-15 07:50:44] [INFO ] Deduced a trap composed of 152 places in 220 ms of which 1 ms to minimize.
[2023-03-15 07:50:50] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2023-03-15 07:50:51] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 1 ms to minimize.
[2023-03-15 07:51:00] [INFO ] Trap strengthening (SAT) tested/added 111/111 trap constraints in 57974 ms
[2023-03-15 07:51:00] [INFO ] After 58231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:51:00] [INFO ] After 58528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72594 resets, run finished after 9392 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9690 resets, run finished after 1722 ms. (steps per millisecond=580 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6830489 steps, run timeout after 33001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 6830489 steps, saw 1188363 distinct states, run finished after 33001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:51:44] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:51:44] [INFO ] Invariant cache hit.
[2023-03-15 07:51:44] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 07:51:44] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 07:51:44] [INFO ] After 249ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:51:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:51:44] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:51:44] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:51:44] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 07:51:44] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 07:51:45] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:51:45] [INFO ] After 202ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:51:45] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 1 ms to minimize.
[2023-03-15 07:51:45] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:51:46] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 1 ms to minimize.
[2023-03-15 07:51:46] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 1 ms to minimize.
[2023-03-15 07:51:46] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:51:46] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 1 ms to minimize.
[2023-03-15 07:51:47] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:51:47] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 1 ms to minimize.
[2023-03-15 07:51:47] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-15 07:51:48] [INFO ] Deduced a trap composed of 175 places in 230 ms of which 1 ms to minimize.
[2023-03-15 07:51:48] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 0 ms to minimize.
[2023-03-15 07:51:48] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 1 ms to minimize.
[2023-03-15 07:51:48] [INFO ] Deduced a trap composed of 150 places in 210 ms of which 1 ms to minimize.
[2023-03-15 07:51:49] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:51:49] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 1 ms to minimize.
[2023-03-15 07:51:49] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 0 ms to minimize.
[2023-03-15 07:51:50] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 0 ms to minimize.
[2023-03-15 07:51:50] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 1 ms to minimize.
[2023-03-15 07:51:50] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 1 ms to minimize.
[2023-03-15 07:51:50] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 1 ms to minimize.
[2023-03-15 07:51:51] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:51:51] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2023-03-15 07:51:51] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 1 ms to minimize.
[2023-03-15 07:51:51] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 0 ms to minimize.
[2023-03-15 07:51:52] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 0 ms to minimize.
[2023-03-15 07:51:52] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:51:52] [INFO ] Deduced a trap composed of 168 places in 227 ms of which 1 ms to minimize.
[2023-03-15 07:51:53] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 0 ms to minimize.
[2023-03-15 07:51:53] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:51:53] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 0 ms to minimize.
[2023-03-15 07:51:53] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 1 ms to minimize.
[2023-03-15 07:51:54] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 1 ms to minimize.
[2023-03-15 07:51:54] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 0 ms to minimize.
[2023-03-15 07:51:54] [INFO ] Deduced a trap composed of 154 places in 226 ms of which 0 ms to minimize.
[2023-03-15 07:51:54] [INFO ] Deduced a trap composed of 156 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:51:55] [INFO ] Deduced a trap composed of 158 places in 237 ms of which 1 ms to minimize.
[2023-03-15 07:51:55] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 0 ms to minimize.
[2023-03-15 07:51:55] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 1 ms to minimize.
[2023-03-15 07:51:56] [INFO ] Deduced a trap composed of 168 places in 220 ms of which 0 ms to minimize.
[2023-03-15 07:51:56] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:51:56] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 0 ms to minimize.
[2023-03-15 07:51:56] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 1 ms to minimize.
[2023-03-15 07:51:57] [INFO ] Deduced a trap composed of 168 places in 228 ms of which 0 ms to minimize.
[2023-03-15 07:51:57] [INFO ] Deduced a trap composed of 177 places in 212 ms of which 1 ms to minimize.
[2023-03-15 07:51:57] [INFO ] Deduced a trap composed of 171 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:51:58] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 0 ms to minimize.
[2023-03-15 07:51:58] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 0 ms to minimize.
[2023-03-15 07:51:58] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 0 ms to minimize.
[2023-03-15 07:51:58] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2023-03-15 07:51:59] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-15 07:51:59] [INFO ] Deduced a trap composed of 154 places in 213 ms of which 1 ms to minimize.
[2023-03-15 07:51:59] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 0 ms to minimize.
[2023-03-15 07:51:59] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:52:00] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:52:00] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 1 ms to minimize.
[2023-03-15 07:52:00] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2023-03-15 07:52:01] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 1 ms to minimize.
[2023-03-15 07:52:01] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 0 ms to minimize.
[2023-03-15 07:52:01] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 1 ms to minimize.
[2023-03-15 07:52:02] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:52:02] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2023-03-15 07:52:03] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2023-03-15 07:52:03] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:52:03] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 1 ms to minimize.
[2023-03-15 07:52:05] [INFO ] Deduced a trap composed of 162 places in 259 ms of which 1 ms to minimize.
[2023-03-15 07:52:05] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 0 ms to minimize.
[2023-03-15 07:52:05] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-15 07:52:06] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 1 ms to minimize.
[2023-03-15 07:52:06] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2023-03-15 07:52:06] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 0 ms to minimize.
[2023-03-15 07:52:07] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:52:07] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :4.10765e+06 after 9.77658e+06
[2023-03-15 07:52:08] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 1 ms to minimize.
[2023-03-15 07:52:09] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 0 ms to minimize.
[2023-03-15 07:52:09] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2023-03-15 07:52:09] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2023-03-15 07:52:10] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 0 ms to minimize.
[2023-03-15 07:52:10] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 0 ms to minimize.
[2023-03-15 07:52:10] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 1 ms to minimize.
[2023-03-15 07:52:11] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 1 ms to minimize.
[2023-03-15 07:52:11] [INFO ] Deduced a trap composed of 173 places in 208 ms of which 1 ms to minimize.
[2023-03-15 07:52:11] [INFO ] Deduced a trap composed of 156 places in 251 ms of which 1 ms to minimize.
[2023-03-15 07:52:12] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2023-03-15 07:52:12] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 1 ms to minimize.
[2023-03-15 07:52:13] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 1 ms to minimize.
[2023-03-15 07:52:13] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 1 ms to minimize.
[2023-03-15 07:52:13] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 1 ms to minimize.
[2023-03-15 07:52:15] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2023-03-15 07:52:16] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 07:52:16] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2023-03-15 07:52:16] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:52:17] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2023-03-15 07:52:18] [INFO ] Deduced a trap composed of 156 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:52:18] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 0 ms to minimize.
[2023-03-15 07:52:19] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-15 07:52:20] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:52:20] [INFO ] Deduced a trap composed of 168 places in 229 ms of which 0 ms to minimize.
[2023-03-15 07:52:20] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 0 ms to minimize.
[2023-03-15 07:52:21] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 0 ms to minimize.
[2023-03-15 07:52:22] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2023-03-15 07:52:22] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-15 07:52:23] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:52:23] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 0 ms to minimize.
[2023-03-15 07:52:23] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 0 ms to minimize.
[2023-03-15 07:52:27] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 0 ms to minimize.
[2023-03-15 07:52:27] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2023-03-15 07:52:27] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2023-03-15 07:52:28] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-15 07:52:28] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-15 07:52:29] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 0 ms to minimize.
[2023-03-15 07:52:29] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2023-03-15 07:52:29] [INFO ] Deduced a trap composed of 169 places in 213 ms of which 1 ms to minimize.
[2023-03-15 07:52:30] [INFO ] Deduced a trap composed of 156 places in 209 ms of which 1 ms to minimize.
[2023-03-15 07:52:31] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2023-03-15 07:52:31] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 0 ms to minimize.
[2023-03-15 07:52:33] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2023-03-15 07:52:42] [INFO ] Trap strengthening (SAT) tested/added 116/116 trap constraints in 57528 ms
[2023-03-15 07:52:43] [INFO ] After 57907ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:52:43] [INFO ] After 58235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 39 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 23 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 07:52:43] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:52:43] [INFO ] Invariant cache hit.
[2023-03-15 07:52:43] [INFO ] Implicit Places using invariants in 644 ms returned []
[2023-03-15 07:52:43] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:52:43] [INFO ] Invariant cache hit.
[2023-03-15 07:52:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:52:46] [INFO ] Implicit Places using invariants and state equation in 2230 ms returned []
Implicit Place search using SMT with State Equation took 2884 ms to find 0 implicit places.
[2023-03-15 07:52:46] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 07:52:46] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:52:46] [INFO ] Invariant cache hit.
[2023-03-15 07:52:46] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3312 ms. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 100000 steps, including 7262 resets, run finished after 962 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:52:47] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:52:47] [INFO ] Invariant cache hit.
[2023-03-15 07:52:47] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-15 07:52:47] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 07:52:47] [INFO ] After 205ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:52:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:52:47] [INFO ] After 31ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 07:52:47] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 0 ms to minimize.
[2023-03-15 07:52:48] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 0 ms to minimize.
[2023-03-15 07:52:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 530 ms
[2023-03-15 07:52:48] [INFO ] After 593ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:52:48] [INFO ] After 874ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:52:48] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-15 07:52:48] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 07:52:48] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:52:48] [INFO ] After 182ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:52:48] [INFO ] Deduced a trap composed of 174 places in 207 ms of which 0 ms to minimize.
[2023-03-15 07:52:49] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:52:49] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:52:49] [INFO ] Deduced a trap composed of 174 places in 220 ms of which 1 ms to minimize.
[2023-03-15 07:52:50] [INFO ] Deduced a trap composed of 172 places in 252 ms of which 1 ms to minimize.
[2023-03-15 07:52:50] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:52:50] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:52:50] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2023-03-15 07:52:51] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 0 ms to minimize.
[2023-03-15 07:52:51] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2023-03-15 07:52:51] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2023-03-15 07:52:51] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2023-03-15 07:52:52] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:52:52] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 0 ms to minimize.
[2023-03-15 07:52:52] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2023-03-15 07:52:52] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 1 ms to minimize.
[2023-03-15 07:52:53] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 0 ms to minimize.
[2023-03-15 07:52:53] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2023-03-15 07:52:53] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 1 ms to minimize.
[2023-03-15 07:52:53] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2023-03-15 07:52:54] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 0 ms to minimize.
[2023-03-15 07:52:54] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2023-03-15 07:52:54] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 1 ms to minimize.
[2023-03-15 07:52:55] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 1 ms to minimize.
[2023-03-15 07:52:55] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2023-03-15 07:52:55] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 0 ms to minimize.
[2023-03-15 07:52:55] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 07:52:56] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 1 ms to minimize.
[2023-03-15 07:52:56] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:52:56] [INFO ] Deduced a trap composed of 175 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:52:56] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 0 ms to minimize.
[2023-03-15 07:52:57] [INFO ] Deduced a trap composed of 169 places in 205 ms of which 0 ms to minimize.
[2023-03-15 07:52:57] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:52:58] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:52:59] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:52:59] [INFO ] Deduced a trap composed of 154 places in 211 ms of which 1 ms to minimize.
[2023-03-15 07:52:59] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 1 ms to minimize.
[2023-03-15 07:52:59] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 0 ms to minimize.
[2023-03-15 07:53:00] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 1 ms to minimize.
[2023-03-15 07:53:00] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2023-03-15 07:53:00] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 1 ms to minimize.
[2023-03-15 07:53:01] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 0 ms to minimize.
[2023-03-15 07:53:01] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 0 ms to minimize.
[2023-03-15 07:53:01] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2023-03-15 07:53:01] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2023-03-15 07:53:02] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 1 ms to minimize.
[2023-03-15 07:53:02] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 1 ms to minimize.
[2023-03-15 07:53:02] [INFO ] Deduced a trap composed of 152 places in 194 ms of which 0 ms to minimize.
[2023-03-15 07:53:02] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 0 ms to minimize.
[2023-03-15 07:53:03] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 1 ms to minimize.
[2023-03-15 07:53:03] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 0 ms to minimize.
[2023-03-15 07:53:04] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-15 07:53:04] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2023-03-15 07:53:04] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 0 ms to minimize.
[2023-03-15 07:53:05] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 0 ms to minimize.
[2023-03-15 07:53:05] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:53:06] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 0 ms to minimize.
[2023-03-15 07:53:06] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 1 ms to minimize.
[2023-03-15 07:53:06] [INFO ] Deduced a trap composed of 154 places in 226 ms of which 0 ms to minimize.
[2023-03-15 07:53:06] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:53:07] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:53:07] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:53:07] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2023-03-15 07:53:07] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:53:08] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 07:53:08] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2023-03-15 07:53:08] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 0 ms to minimize.
[2023-03-15 07:53:09] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2023-03-15 07:53:09] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 0 ms to minimize.
[2023-03-15 07:53:09] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:53:10] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 0 ms to minimize.
[2023-03-15 07:53:10] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:53:10] [INFO ] Deduced a trap composed of 173 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:53:10] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:53:11] [INFO ] Deduced a trap composed of 168 places in 227 ms of which 0 ms to minimize.
[2023-03-15 07:53:11] [INFO ] Deduced a trap composed of 170 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:53:11] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 0 ms to minimize.
[2023-03-15 07:53:12] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 1 ms to minimize.
[2023-03-15 07:53:12] [INFO ] Deduced a trap composed of 164 places in 233 ms of which 1 ms to minimize.
[2023-03-15 07:53:13] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 1 ms to minimize.
[2023-03-15 07:53:13] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:53:13] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 1 ms to minimize.
[2023-03-15 07:53:14] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:53:14] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 0 ms to minimize.
[2023-03-15 07:53:14] [INFO ] Deduced a trap composed of 168 places in 229 ms of which 0 ms to minimize.
[2023-03-15 07:53:15] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:53:15] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:53:16] [INFO ] Deduced a trap composed of 158 places in 235 ms of which 0 ms to minimize.
[2023-03-15 07:53:16] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:53:16] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 1 ms to minimize.
[2023-03-15 07:53:17] [INFO ] Deduced a trap composed of 170 places in 220 ms of which 0 ms to minimize.
[2023-03-15 07:53:17] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:53:17] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:53:17] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2023-03-15 07:53:18] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 0 ms to minimize.
[2023-03-15 07:53:19] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 1 ms to minimize.
[2023-03-15 07:53:20] [INFO ] Deduced a trap composed of 156 places in 235 ms of which 0 ms to minimize.
[2023-03-15 07:53:20] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:53:23] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 17 ms to minimize.
[2023-03-15 07:53:24] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:53:24] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:53:25] [INFO ] Deduced a trap composed of 156 places in 228 ms of which 1 ms to minimize.
[2023-03-15 07:53:25] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:53:26] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:53:28] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 0 ms to minimize.
[2023-03-15 07:53:29] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:53:29] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:53:29] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 0 ms to minimize.
[2023-03-15 07:53:31] [INFO ] Deduced a trap composed of 152 places in 230 ms of which 0 ms to minimize.
[2023-03-15 07:53:37] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 0 ms to minimize.
[2023-03-15 07:53:37] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 0 ms to minimize.
[2023-03-15 07:53:46] [INFO ] Trap strengthening (SAT) tested/added 111/111 trap constraints in 58164 ms
[2023-03-15 07:53:46] [INFO ] After 58420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:53:46] [INFO ] After 58696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10001 steps, including 736 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 587953 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 587953 steps, saw 95576 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:53:50] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:53:50] [INFO ] Invariant cache hit.
[2023-03-15 07:53:50] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 07:53:50] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 07:53:50] [INFO ] After 239ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:53:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:53:50] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:53:50] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:53:50] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 07:53:50] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 07:53:50] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:53:50] [INFO ] After 146ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:53:51] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 1 ms to minimize.
[2023-03-15 07:53:51] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2023-03-15 07:53:51] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:53:51] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 0 ms to minimize.
[2023-03-15 07:53:52] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:53:52] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:53:52] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:53:53] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 0 ms to minimize.
[2023-03-15 07:53:53] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:53:53] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 1 ms to minimize.
[2023-03-15 07:53:53] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 0 ms to minimize.
[2023-03-15 07:53:54] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 1 ms to minimize.
[2023-03-15 07:53:54] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2023-03-15 07:53:54] [INFO ] Deduced a trap composed of 154 places in 222 ms of which 1 ms to minimize.
[2023-03-15 07:53:55] [INFO ] Deduced a trap composed of 185 places in 235 ms of which 0 ms to minimize.
[2023-03-15 07:53:55] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 0 ms to minimize.
[2023-03-15 07:53:55] [INFO ] Deduced a trap composed of 175 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:53:56] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 0 ms to minimize.
[2023-03-15 07:53:56] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:53:56] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:53:57] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2023-03-15 07:53:57] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:53:57] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 524288
[2023-03-15 07:53:57] [INFO ] Deduced a trap composed of 179 places in 220 ms of which 1 ms to minimize.
[2023-03-15 07:53:58] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
SDD size :9.77658e+06 after 1.78448e+07
[2023-03-15 07:53:58] [INFO ] Deduced a trap composed of 171 places in 232 ms of which 0 ms to minimize.
[2023-03-15 07:53:58] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 0 ms to minimize.
[2023-03-15 07:53:59] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:53:59] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:54:00] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 1 ms to minimize.
[2023-03-15 07:54:00] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:54:01] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 0 ms to minimize.
[2023-03-15 07:54:01] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 1 ms to minimize.
[2023-03-15 07:54:01] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 0 ms to minimize.
[2023-03-15 07:54:01] [INFO ] Deduced a trap composed of 173 places in 231 ms of which 0 ms to minimize.
[2023-03-15 07:54:02] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 0 ms to minimize.
[2023-03-15 07:54:02] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 0 ms to minimize.
[2023-03-15 07:54:03] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-15 07:54:03] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 1 ms to minimize.
[2023-03-15 07:54:03] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-15 07:54:03] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-15 07:54:04] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-15 07:54:04] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2023-03-15 07:54:04] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:54:04] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 0 ms to minimize.
[2023-03-15 07:54:05] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-15 07:54:05] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2023-03-15 07:54:05] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 0 ms to minimize.
[2023-03-15 07:54:06] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2023-03-15 07:54:06] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 1 ms to minimize.
[2023-03-15 07:54:06] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 0 ms to minimize.
[2023-03-15 07:54:07] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2023-03-15 07:54:07] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 1 ms to minimize.
[2023-03-15 07:54:07] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 1 ms to minimize.
[2023-03-15 07:54:07] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2023-03-15 07:54:08] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 1 ms to minimize.
[2023-03-15 07:54:08] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2023-03-15 07:54:08] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2023-03-15 07:54:09] [INFO ] Deduced a trap composed of 152 places in 209 ms of which 1 ms to minimize.
[2023-03-15 07:54:09] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 1 ms to minimize.
[2023-03-15 07:54:09] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 1 ms to minimize.
[2023-03-15 07:54:09] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-15 07:54:10] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2023-03-15 07:54:10] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 0 ms to minimize.
[2023-03-15 07:54:10] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-15 07:54:11] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 07:54:11] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 1 ms to minimize.
[2023-03-15 07:54:11] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-15 07:54:12] [INFO ] Deduced a trap composed of 154 places in 209 ms of which 0 ms to minimize.
[2023-03-15 07:54:12] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 0 ms to minimize.
[2023-03-15 07:54:12] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 0 ms to minimize.
[2023-03-15 07:54:13] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 1 ms to minimize.
[2023-03-15 07:54:13] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2023-03-15 07:54:13] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-15 07:54:14] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 0 ms to minimize.
[2023-03-15 07:54:15] [INFO ] Trap strengthening (SAT) tested/added 75/75 trap constraints in 24546 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:54:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:54:15] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 18 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 07:54:15] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:54:15] [INFO ] Invariant cache hit.
[2023-03-15 07:54:15] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 408 ms. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 10000 steps, including 721 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 588979 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 588979 steps, saw 95733 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:54:19] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:54:19] [INFO ] Invariant cache hit.
[2023-03-15 07:54:19] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 07:54:19] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 07:54:19] [INFO ] After 232ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:54:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:54:19] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:54:19] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:54:19] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-15 07:54:19] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 07:54:19] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:54:19] [INFO ] After 139ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:54:20] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 1 ms to minimize.
[2023-03-15 07:54:20] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2023-03-15 07:54:20] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:54:20] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 1 ms to minimize.
[2023-03-15 07:54:21] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 1 ms to minimize.
[2023-03-15 07:54:21] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 0 ms to minimize.
[2023-03-15 07:54:21] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:54:22] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:54:22] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 0 ms to minimize.
[2023-03-15 07:54:22] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:54:22] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:54:23] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:54:23] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:54:23] [INFO ] Deduced a trap composed of 154 places in 221 ms of which 1 ms to minimize.
[2023-03-15 07:54:24] [INFO ] Deduced a trap composed of 185 places in 231 ms of which 1 ms to minimize.
[2023-03-15 07:54:24] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 1 ms to minimize.
[2023-03-15 07:54:24] [INFO ] Deduced a trap composed of 175 places in 242 ms of which 1 ms to minimize.
[2023-03-15 07:54:25] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:54:25] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:54:25] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 1 ms to minimize.
[2023-03-15 07:54:26] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:54:26] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2023-03-15 07:54:26] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:54:26] [INFO ] Deduced a trap composed of 179 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:54:27] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:54:27] [INFO ] Deduced a trap composed of 171 places in 231 ms of which 0 ms to minimize.
[2023-03-15 07:54:27] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:54:28] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 0 ms to minimize.
[2023-03-15 07:54:28] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:54:29] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:54:29] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:54:30] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:54:30] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:54:30] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:54:30] [INFO ] Deduced a trap composed of 173 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:54:31] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 1 ms to minimize.
[2023-03-15 07:54:31] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2023-03-15 07:54:32] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 0 ms to minimize.
[2023-03-15 07:54:32] [INFO ] Deduced a trap composed of 156 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:54:32] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 1 ms to minimize.
[2023-03-15 07:54:32] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:54:33] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:54:33] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 1 ms to minimize.
[2023-03-15 07:54:33] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2023-03-15 07:54:34] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 1 ms to minimize.
[2023-03-15 07:54:34] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:54:34] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:54:34] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 0 ms to minimize.
[2023-03-15 07:54:35] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2023-03-15 07:54:35] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2023-03-15 07:54:36] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:54:36] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 0 ms to minimize.
[2023-03-15 07:54:36] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2023-03-15 07:54:37] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:54:37] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2023-03-15 07:54:37] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:54:37] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 1 ms to minimize.
[2023-03-15 07:54:38] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2023-03-15 07:54:38] [INFO ] Deduced a trap composed of 152 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:54:38] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 0 ms to minimize.
[2023-03-15 07:54:39] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:54:39] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:54:39] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2023-03-15 07:54:40] [INFO ] Deduced a trap composed of 156 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:54:40] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:54:40] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 0 ms to minimize.
[2023-03-15 07:54:41] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:54:41] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 1 ms to minimize.
[2023-03-15 07:54:41] [INFO ] Deduced a trap composed of 154 places in 230 ms of which 0 ms to minimize.
[2023-03-15 07:54:41] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 1 ms to minimize.
[2023-03-15 07:54:42] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 1 ms to minimize.
[2023-03-15 07:54:42] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 1 ms to minimize.
[2023-03-15 07:54:42] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
[2023-03-15 07:54:43] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:54:43] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 1 ms to minimize.
[2023-03-15 07:54:44] [INFO ] Trap strengthening (SAT) tested/added 75/75 trap constraints in 24554 ms
[2023-03-15 07:54:44] [INFO ] After 24700ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:54:44] [INFO ] After 25009ms 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 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 42 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 07:54:44] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:54:44] [INFO ] Invariant cache hit.
[2023-03-15 07:54:44] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-15 07:54:44] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:54:44] [INFO ] Invariant cache hit.
[2023-03-15 07:54:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:54:46] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
[2023-03-15 07:54:46] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-15 07:54:46] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 07:54:46] [INFO ] Invariant cache hit.
[2023-03-15 07:54:47] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2636 ms. Remains : 410/410 places, 981/981 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
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 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 97 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2023-03-15 07:54:47] [INFO ] Computed 62 place invariants in 18 ms
[2023-03-15 07:54:47] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 07:54:47] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 07:54:47] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:54:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 07:54:47] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 07:54:47] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:54:47] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2023-03-15 07:54:48] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 1 ms to minimize.
[2023-03-15 07:54:48] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2023-03-15 07:54:48] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 0 ms to minimize.
[2023-03-15 07:54:48] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:54:48] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 1 ms to minimize.
[2023-03-15 07:54:49] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-15 07:54:49] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 0 ms to minimize.
[2023-03-15 07:54:49] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:54:49] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2023-03-15 07:54:50] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2023-03-15 07:54:50] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2023-03-15 07:54:50] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-15 07:54:50] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 1 ms to minimize.
[2023-03-15 07:54:51] [INFO ] Deduced a trap composed of 154 places in 187 ms of which 1 ms to minimize.
[2023-03-15 07:54:51] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 1 ms to minimize.
[2023-03-15 07:54:51] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:54:51] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2023-03-15 07:54:51] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 1 ms to minimize.
[2023-03-15 07:54:52] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 1 ms to minimize.
[2023-03-15 07:54:52] [INFO ] Deduced a trap composed of 152 places in 191 ms of which 0 ms to minimize.
[2023-03-15 07:54:52] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 1 ms to minimize.
[2023-03-15 07:54:52] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 1 ms to minimize.
[2023-03-15 07:54:53] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 1 ms to minimize.
[2023-03-15 07:54:53] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2023-03-15 07:54:53] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 0 ms to minimize.
[2023-03-15 07:54:53] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2023-03-15 07:54:53] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:54:54] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 1 ms to minimize.
[2023-03-15 07:54:54] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:54:54] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 1 ms to minimize.
[2023-03-15 07:54:54] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 0 ms to minimize.
[2023-03-15 07:54:55] [INFO ] Deduced a trap composed of 152 places in 198 ms of which 1 ms to minimize.
[2023-03-15 07:54:55] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 1 ms to minimize.
[2023-03-15 07:54:55] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2023-03-15 07:54:55] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2023-03-15 07:54:55] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 0 ms to minimize.
[2023-03-15 07:54:56] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 1 ms to minimize.
[2023-03-15 07:54:56] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:54:56] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 0 ms to minimize.
[2023-03-15 07:54:56] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-15 07:54:57] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:54:57] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 1 ms to minimize.
[2023-03-15 07:54:57] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 0 ms to minimize.
[2023-03-15 07:54:57] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 0 ms to minimize.
[2023-03-15 07:54:58] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2023-03-15 07:54:58] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:54:58] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 1 ms to minimize.
[2023-03-15 07:54:58] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 0 ms to minimize.
[2023-03-15 07:54:59] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 1 ms to minimize.
[2023-03-15 07:54:59] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2023-03-15 07:54:59] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:55:00] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2023-03-15 07:55:00] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 0 ms to minimize.
[2023-03-15 07:55:00] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2023-03-15 07:55:00] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 0 ms to minimize.
[2023-03-15 07:55:01] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2023-03-15 07:55:01] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 1 ms to minimize.
[2023-03-15 07:55:01] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 0 ms to minimize.
[2023-03-15 07:55:01] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 1 ms to minimize.
[2023-03-15 07:55:02] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 0 ms to minimize.
[2023-03-15 07:55:02] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 0 ms to minimize.
[2023-03-15 07:55:02] [INFO ] Deduced a trap composed of 159 places in 193 ms of which 1 ms to minimize.
[2023-03-15 07:55:02] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 1 ms to minimize.
[2023-03-15 07:55:02] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 0 ms to minimize.
[2023-03-15 07:55:03] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 1 ms to minimize.
[2023-03-15 07:55:03] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 0 ms to minimize.
[2023-03-15 07:55:03] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 0 ms to minimize.
[2023-03-15 07:55:03] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 0 ms to minimize.
[2023-03-15 07:55:04] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 1 ms to minimize.
[2023-03-15 07:55:04] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 0 ms to minimize.
[2023-03-15 07:55:04] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 1 ms to minimize.
[2023-03-15 07:55:04] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 0 ms to minimize.
[2023-03-15 07:55:04] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-15 07:55:05] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 1 ms to minimize.
[2023-03-15 07:55:05] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 0 ms to minimize.
[2023-03-15 07:55:05] [INFO ] Deduced a trap composed of 152 places in 191 ms of which 0 ms to minimize.
[2023-03-15 07:55:05] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 0 ms to minimize.
[2023-03-15 07:55:06] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 0 ms to minimize.
[2023-03-15 07:55:06] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2023-03-15 07:55:06] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 1 ms to minimize.
[2023-03-15 07:55:06] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2023-03-15 07:55:06] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 0 ms to minimize.
[2023-03-15 07:55:07] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2023-03-15 07:55:07] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 1 ms to minimize.
[2023-03-15 07:55:07] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 1 ms to minimize.
[2023-03-15 07:55:07] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 1 ms to minimize.
[2023-03-15 07:55:08] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2023-03-15 07:55:08] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2023-03-15 07:57:25] [INFO ] Flatten gal took : 127 ms
[2023-03-15 07:57:25] [INFO ] Applying decomposition
[2023-03-15 07:57:25] [INFO ] Flatten gal took : 118 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13170569089788722080.txt' '-o' '/tmp/graph13170569089788722080.bin' '-w' '/tmp/graph13170569089788722080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13170569089788722080.bin' '-l' '-1' '-v' '-w' '/tmp/graph13170569089788722080.weights' '-q' '0' '-e' '0.001'
[2023-03-15 07:57:25] [INFO ] Decomposing Gal with order
[2023-03-15 07:57:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:57:26] [INFO ] Removed a total of 4393 redundant transitions.
[2023-03-15 07:57:26] [INFO ] Flatten gal took : 302 ms
[2023-03-15 07:57:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 54 ms.
[2023-03-15 07:57:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12662202857247289798.gal : 25 ms
[2023-03-15 07:57:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5186249498094731137.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12662202857247289798.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5186249498094731137.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5186249498094731137.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 55
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1286 after 1340
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1340 after 22539
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22539 after 22557
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22557 after 22593
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :22593 after 22656
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :22656 after 119775
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :119775 after 128775
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :128775 after 146415
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :146415 after 184935
[2023-03-15 07:58:32] [INFO ] Trap strengthening (SAT) tested/added 89/89 trap constraints in 224699 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:58:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:58:32] [INFO ] After 225021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
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 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 73 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-15 07:58:32] [INFO ] Invariant cache hit.
[2023-03-15 07:58:32] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2023-03-15 07:58:32] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 07:58:32] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:58:32] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-15 07:58:32] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 07:58:32] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:58:33] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 0 ms to minimize.
[2023-03-15 07:58:33] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2023-03-15 07:58:33] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2023-03-15 07:58:33] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-15 07:58:34] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:58:34] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 1 ms to minimize.
[2023-03-15 07:58:34] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 1 ms to minimize.
[2023-03-15 07:58:34] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 0 ms to minimize.
[2023-03-15 07:58:35] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 1 ms to minimize.
[2023-03-15 07:58:35] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 0 ms to minimize.
[2023-03-15 07:58:35] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 0 ms to minimize.
[2023-03-15 07:58:35] [INFO ] Deduced a trap composed of 154 places in 178 ms of which 0 ms to minimize.
[2023-03-15 07:58:35] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 1 ms to minimize.
[2023-03-15 07:58:36] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 1 ms to minimize.
[2023-03-15 07:58:36] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:58:36] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 1 ms to minimize.
[2023-03-15 07:58:36] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 1 ms to minimize.
[2023-03-15 07:58:37] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 1 ms to minimize.
[2023-03-15 07:58:37] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 0 ms to minimize.
[2023-03-15 07:58:37] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 1 ms to minimize.
[2023-03-15 07:58:37] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 1 ms to minimize.
[2023-03-15 07:58:37] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 1 ms to minimize.
[2023-03-15 07:58:38] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 0 ms to minimize.
[2023-03-15 07:58:38] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 1 ms to minimize.
[2023-03-15 07:58:38] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 1 ms to minimize.
[2023-03-15 07:58:38] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 1 ms to minimize.
[2023-03-15 07:58:38] [INFO ] Deduced a trap composed of 152 places in 175 ms of which 1 ms to minimize.
[2023-03-15 07:58:39] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 0 ms to minimize.
[2023-03-15 07:58:39] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 0 ms to minimize.
[2023-03-15 07:58:39] [INFO ] Deduced a trap composed of 154 places in 171 ms of which 0 ms to minimize.
[2023-03-15 07:58:39] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 0 ms to minimize.
[2023-03-15 07:58:40] [INFO ] Deduced a trap composed of 156 places in 176 ms of which 0 ms to minimize.
[2023-03-15 07:58:40] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 0 ms to minimize.
[2023-03-15 07:58:40] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2023-03-15 07:58:40] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2023-03-15 07:58:40] [INFO ] Deduced a trap composed of 154 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:58:41] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2023-03-15 07:58:41] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:58:41] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 0 ms to minimize.
[2023-03-15 07:58:41] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:58:41] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 0 ms to minimize.
[2023-03-15 07:58:42] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 0 ms to minimize.
[2023-03-15 07:58:42] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 1 ms to minimize.
[2023-03-15 07:58:42] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 0 ms to minimize.
[2023-03-15 07:58:42] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 0 ms to minimize.
[2023-03-15 07:58:43] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 1 ms to minimize.
[2023-03-15 07:58:43] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:58:43] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:58:43] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:58:43] [INFO ] Deduced a trap composed of 154 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:58:44] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 1 ms to minimize.
[2023-03-15 07:58:44] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:58:44] [INFO ] Deduced a trap composed of 152 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:58:44] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 0 ms to minimize.
[2023-03-15 07:58:45] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 0 ms to minimize.
[2023-03-15 07:58:45] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2023-03-15 07:58:45] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 1 ms to minimize.
[2023-03-15 07:58:45] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 0 ms to minimize.
[2023-03-15 07:58:46] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 0 ms to minimize.
[2023-03-15 07:58:46] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 1 ms to minimize.
[2023-03-15 07:58:46] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 0 ms to minimize.
[2023-03-15 07:58:46] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 0 ms to minimize.
[2023-03-15 07:58:46] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:58:47] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 1 ms to minimize.
[2023-03-15 07:58:47] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 1 ms to minimize.
[2023-03-15 07:58:47] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 0 ms to minimize.
[2023-03-15 07:58:47] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-15 07:58:47] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:58:48] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 0 ms to minimize.
[2023-03-15 07:58:48] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 1 ms to minimize.
[2023-03-15 07:58:48] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:58:48] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:58:48] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 1 ms to minimize.
[2023-03-15 07:58:49] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 0 ms to minimize.
[2023-03-15 07:58:49] [INFO ] Deduced a trap composed of 156 places in 184 ms of which 1 ms to minimize.
[2023-03-15 07:58:49] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 1 ms to minimize.
[2023-03-15 07:58:49] [INFO ] Deduced a trap composed of 166 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:58:50] [INFO ] Deduced a trap composed of 165 places in 178 ms of which 1 ms to minimize.
[2023-03-15 07:58:50] [INFO ] Deduced a trap composed of 152 places in 173 ms of which 0 ms to minimize.
[2023-03-15 07:58:50] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 1 ms to minimize.
[2023-03-15 07:58:50] [INFO ] Deduced a trap composed of 165 places in 169 ms of which 0 ms to minimize.
[2023-03-15 07:58:50] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 0 ms to minimize.
[2023-03-15 07:58:51] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:58:51] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 1 ms to minimize.
[2023-03-15 07:58:51] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 0 ms to minimize.
[2023-03-15 07:58:51] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:58:51] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:58:52] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 1 ms to minimize.
[2023-03-15 07:58:52] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 0 ms to minimize.
[2023-03-15 07:58:52] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 1 ms to minimize.
[2023-03-15 07:58:52] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 1 ms to minimize.
[2023-03-15 07:58:52] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 1 ms to minimize.
[2023-03-15 07:58:53] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:58:53] [INFO ] Deduced a trap composed of 154 places in 173 ms of which 0 ms to minimize.
[2023-03-15 07:58:53] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 1 ms to minimize.
[2023-03-15 07:58:53] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:58:54] [INFO ] Deduced a trap composed of 160 places in 167 ms of which 0 ms to minimize.
[2023-03-15 07:58:54] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:58:54] [INFO ] Deduced a trap composed of 156 places in 166 ms of which 0 ms to minimize.
[2023-03-15 07:58:54] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:58:54] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2023-03-15 07:58:55] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:58:55] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2023-03-15 07:58:55] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 0 ms to minimize.
[2023-03-15 07:58:55] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:58:55] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 0 ms to minimize.
[2023-03-15 07:58:56] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 0 ms to minimize.
[2023-03-15 07:58:56] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 1 ms to minimize.
[2023-03-15 07:58:56] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2023-03-15 07:58:56] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 1 ms to minimize.
[2023-03-15 07:58:56] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-15 07:58:57] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 0 ms to minimize.
[2023-03-15 07:58:57] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 1 ms to minimize.
[2023-03-15 07:58:57] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:58:57] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 0 ms to minimize.
[2023-03-15 07:58:57] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 1 ms to minimize.
[2023-03-15 07:58:58] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-15 07:58:58] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 0 ms to minimize.
[2023-03-15 07:58:58] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:58:59] [INFO ] Deduced a trap composed of 154 places in 176 ms of which 1 ms to minimize.
[2023-03-15 07:58:59] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 1 ms to minimize.
[2023-03-15 07:58:59] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 0 ms to minimize.
[2023-03-15 07:58:59] [INFO ] Deduced a trap composed of 166 places in 171 ms of which 0 ms to minimize.
[2023-03-15 07:59:00] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 13 ms to minimize.
[2023-03-15 07:59:00] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:59:00] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 1 ms to minimize.
[2023-03-15 07:59:01] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:59:01] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 1 ms to minimize.
[2023-03-15 07:59:01] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 1 ms to minimize.
[2023-03-15 07:59:01] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 0 ms to minimize.
[2023-03-15 07:59:01] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 0 ms to minimize.
[2023-03-15 07:59:02] [INFO ] Deduced a trap composed of 150 places in 177 ms of which 1 ms to minimize.
[2023-03-15 07:59:02] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:59:02] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 1 ms to minimize.
[2023-03-15 07:59:02] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:59:03] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 1 ms to minimize.
[2023-03-15 07:59:03] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:59:04] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2023-03-15 07:59:04] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 0 ms to minimize.
[2023-03-15 07:59:04] [INFO ] Deduced a trap composed of 170 places in 166 ms of which 0 ms to minimize.
[2023-03-15 07:59:04] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 1 ms to minimize.
[2023-03-15 07:59:04] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 0 ms to minimize.
[2023-03-15 07:59:05] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 1 ms to minimize.
[2023-03-15 07:59:05] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 1 ms to minimize.
[2023-03-15 07:59:05] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2023-03-15 07:59:05] [INFO ] Deduced a trap composed of 164 places in 167 ms of which 0 ms to minimize.
[2023-03-15 07:59:05] [INFO ] Deduced a trap composed of 152 places in 174 ms of which 0 ms to minimize.
[2023-03-15 07:59:06] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:59:06] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:59:06] [INFO ] Deduced a trap composed of 166 places in 172 ms of which 1 ms to minimize.
[2023-03-15 07:59:06] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:59:06] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 1 ms to minimize.
[2023-03-15 07:59:08] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 0 ms to minimize.
[2023-03-15 07:59:08] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 1 ms to minimize.
[2023-03-15 07:59:09] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 1 ms to minimize.
[2023-03-15 07:59:09] [INFO ] Deduced a trap composed of 158 places in 163 ms of which 0 ms to minimize.
[2023-03-15 07:59:09] [INFO ] Deduced a trap composed of 154 places in 166 ms of which 1 ms to minimize.
[2023-03-15 07:59:09] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 1 ms to minimize.
[2023-03-15 07:59:09] [INFO ] Deduced a trap composed of 156 places in 166 ms of which 1 ms to minimize.
[2023-03-15 07:59:10] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 1 ms to minimize.
[2023-03-15 07:59:10] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:59:10] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 0 ms to minimize.
[2023-03-15 07:59:10] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 1 ms to minimize.
[2023-03-15 07:59:10] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 0 ms to minimize.
[2023-03-15 07:59:11] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 1 ms to minimize.
[2023-03-15 07:59:11] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:59:11] [INFO ] Deduced a trap composed of 166 places in 172 ms of which 1 ms to minimize.
[2023-03-15 07:59:11] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:59:12] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 1 ms to minimize.
[2023-03-15 08:02:17] [INFO ] Trap strengthening (SAT) tested/added 169/169 trap constraints in 224597 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 08:02:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:02:17] [INFO ] After 225016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
[2023-03-15 08:02:17] [INFO ] Flatten gal took : 69 ms
[2023-03-15 08:02:17] [INFO ] Flatten gal took : 54 ms
[2023-03-15 08:02:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1722686583745359311.gal : 18 ms
[2023-03-15 08:02:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17917840521734568647.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1722686583745359311.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17917840521734568647.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17917840521734568647.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 389
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :389 after 399
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :399 after 433
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :433 after 534
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :534 after 769
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :769 after 1262
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1262 after 2760
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2760 after 5148
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5148 after 230782
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :230782 after 235888
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :235888 after 299019
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :299019 after 425613
Detected timeout of ITS tools.
[2023-03-15 08:02:32] [INFO ] Flatten gal took : 46 ms
[2023-03-15 08:02:32] [INFO ] Applying decomposition
[2023-03-15 08:02:32] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1130402683355493739.txt' '-o' '/tmp/graph1130402683355493739.bin' '-w' '/tmp/graph1130402683355493739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1130402683355493739.bin' '-l' '-1' '-v' '-w' '/tmp/graph1130402683355493739.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:02:33] [INFO ] Decomposing Gal with order
[2023-03-15 08:02:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:02:33] [INFO ] Removed a total of 1052 redundant transitions.
[2023-03-15 08:02:33] [INFO ] Flatten gal took : 188 ms
[2023-03-15 08:02:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 565 labels/synchronizations in 33 ms.
[2023-03-15 08:02:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4773570807049404397.gal : 12 ms
[2023-03-15 08:02:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4652618814068266035.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4773570807049404397.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4652618814068266035.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4652618814068266035.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 49853
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :49853 after 771608
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :771608 after 771624
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :771624 after 797937
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :797937 after 798033
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :798033 after 869884
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :869884 after 942416
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :942416 after 1.01165e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.01165e+06 after 1.03997e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.03997e+06 after 1.06785e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.06785e+06 after 2.50827e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.50827e+06 after 2.67501e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10245419509295648266
[2023-03-15 08:02:48] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10245419509295648266
Running compilation step : cd /tmp/ltsmin10245419509295648266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2142 ms.
Running link step : cd /tmp/ltsmin10245419509295648266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10245419509295648266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 08:03:03] [INFO ] Flatten gal took : 40 ms
[2023-03-15 08:03:03] [INFO ] Flatten gal took : 45 ms
[2023-03-15 08:03:03] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9819305502631822609.gal : 10 ms
[2023-03-15 08:03:03] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12054886721187193831.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9819305502631822609.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12054886721187193831.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability12054886721187193831.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
Detected timeout of ITS tools.
[2023-03-15 08:03:06] [INFO ] Flatten gal took : 39 ms
[2023-03-15 08:03:06] [INFO ] Applying decomposition
[2023-03-15 08:03:06] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10928655902925144436.txt' '-o' '/tmp/graph10928655902925144436.bin' '-w' '/tmp/graph10928655902925144436.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10928655902925144436.bin' '-l' '-1' '-v' '-w' '/tmp/graph10928655902925144436.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:03:06] [INFO ] Decomposing Gal with order
[2023-03-15 08:03:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:03:06] [INFO ] Removed a total of 2800 redundant transitions.
[2023-03-15 08:03:07] [INFO ] Flatten gal took : 96 ms
[2023-03-15 08:03:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 31 ms.
[2023-03-15 08:03:07] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10633487703059222963.gal : 8 ms
[2023-03-15 08:03:07] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16183220727067989855.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10633487703059222963.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16183220727067989855.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityFireability16183220727067989855.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13505330669128782577
[2023-03-15 08:03:10] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13505330669128782577
Running compilation step : cd /tmp/ltsmin13505330669128782577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1985 ms.
Running link step : cd /tmp/ltsmin13505330669128782577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13505330669128782577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 08:03:13] [INFO ] Flatten gal took : 40 ms
[2023-03-15 08:03:13] [INFO ] Flatten gal took : 37 ms
[2023-03-15 08:03:13] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1173259816971698970.gal : 8 ms
[2023-03-15 08:03:13] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8975211784054220634.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability1173259816971698970.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8975211784054220634.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability8975211784054220634.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :96986 after 248582
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :248582 after 599618
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :599618 after 1.62585e+06
Detected timeout of ITS tools.
[2023-03-15 08:03:43] [INFO ] Flatten gal took : 39 ms
[2023-03-15 08:03:43] [INFO ] Applying decomposition
[2023-03-15 08:03:43] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph257649837810049592.txt' '-o' '/tmp/graph257649837810049592.bin' '-w' '/tmp/graph257649837810049592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph257649837810049592.bin' '-l' '-1' '-v' '-w' '/tmp/graph257649837810049592.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:03:43] [INFO ] Decomposing Gal with order
[2023-03-15 08:03:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:03:43] [INFO ] Removed a total of 2742 redundant transitions.
[2023-03-15 08:03:43] [INFO ] Flatten gal took : 80 ms
[2023-03-15 08:03:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 23 ms.
[2023-03-15 08:03:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability242548363174456993.gal : 8 ms
[2023-03-15 08:03:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability975398060473629625.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability242548363174456993.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability975398060473629625.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/ReachabilityFireability975398060473629625.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6333837295470031755
[2023-03-15 08:04:13] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6333837295470031755
Running compilation step : cd /tmp/ltsmin6333837295470031755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1965 ms.
Running link step : cd /tmp/ltsmin6333837295470031755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6333837295470031755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 08:04:43] [INFO ] Flatten gal took : 40 ms
[2023-03-15 08:04:43] [INFO ] Flatten gal took : 38 ms
[2023-03-15 08:04:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5145806595636992534.gal : 7 ms
[2023-03-15 08:04:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13201735027713265638.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5145806595636992534.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13201735027713265638.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability13201735027713265638.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :96986 after 248582
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :248582 after 599618
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :599618 after 1.62585e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.62585e+06 after 3.99829e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :3.99829e+06 after 4.16985e+07
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-15 08:09:44] [INFO ] Flatten gal took : 170 ms
[2023-03-15 08:09:44] [INFO ] Applying decomposition
[2023-03-15 08:09:44] [INFO ] Flatten gal took : 108 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12561940549558600517.txt' '-o' '/tmp/graph12561940549558600517.bin' '-w' '/tmp/graph12561940549558600517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12561940549558600517.bin' '-l' '-1' '-v' '-w' '/tmp/graph12561940549558600517.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:09:45] [INFO ] Decomposing Gal with order
[2023-03-15 08:09:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:09:46] [INFO ] Removed a total of 2740 redundant transitions.
[2023-03-15 08:09:46] [INFO ] Flatten gal took : 104 ms
[2023-03-15 08:09:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 35 ms.
[2023-03-15 08:09:46] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9932184280629600504.gal : 21 ms
[2023-03-15 08:09:46] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15034852920368634535.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9932184280629600504.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15034852920368634535.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability15034852920368634535.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10750509620159971447
[2023-03-15 08:14:46] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10750509620159971447
Running compilation step : cd /tmp/ltsmin10750509620159971447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2035 ms.
Running link step : cd /tmp/ltsmin10750509620159971447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin10750509620159971447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: 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( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed 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( 5/ 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( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.023: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.022: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.023: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.026: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.026: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.026: There are 982 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.026: State length is 410, there are 981 groups
pins2lts-mc-linux64( 0/ 8), 0.026: Running bfs using 8 cores
pins2lts-mc-linux64( 6/ 8), 0.024: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.024: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.026: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.026: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.026: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 7.924: ~2 levels ~960 states ~7432 transitions
pins2lts-mc-linux64( 6/ 8), 8.046: ~3 levels ~1920 states ~13096 transitions
pins2lts-mc-linux64( 6/ 8), 8.364: ~4 levels ~3840 states ~38312 transitions
pins2lts-mc-linux64( 6/ 8), 8.980: ~4 levels ~7680 states ~110464 transitions
pins2lts-mc-linux64( 5/ 8), 9.377: ~7 levels ~15360 states ~169120 transitions
pins2lts-mc-linux64( 5/ 8), 11.663: ~7 levels ~30720 states ~648248 transitions
pins2lts-mc-linux64( 1/ 8), 12.651: ~7 levels ~61440 states ~520664 transitions
pins2lts-mc-linux64( 0/ 8), 13.824: ~9 levels ~122880 states ~967256 transitions
pins2lts-mc-linux64( 7/ 8), 17.027: ~6 levels ~245760 states ~3722576 transitions
pins2lts-mc-linux64( 3/ 8), 21.504: ~6 levels ~491520 states ~6467992 transitions
pins2lts-mc-linux64( 2/ 8), 31.454: ~8 levels ~983040 states ~14657624 transitions
pins2lts-mc-linux64( 6/ 8), 49.911: ~7 levels ~1966080 states ~27006040 transitions
pins2lts-mc-linux64( 6/ 8), 90.645: ~7 levels ~3932160 states ~59673648 transitions
pins2lts-mc-linux64( 6/ 8), 144.744: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 145.034:
pins2lts-mc-linux64( 0/ 8), 145.034: mean standard work distribution: 5.2% (states) 9.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 145.034:
pins2lts-mc-linux64( 0/ 8), 145.034: Explored 5517651 states 106229835 transitions, fanout: 19.253
pins2lts-mc-linux64( 0/ 8), 145.034: Total exploration time 145.000 sec (144.750 sec minimum, 144.822 sec on average)
pins2lts-mc-linux64( 0/ 8), 145.035: States per second: 38053, Transitions per second: 732620
pins2lts-mc-linux64( 0/ 8), 145.035:
pins2lts-mc-linux64( 0/ 8), 145.035: Queue width: 8B, total height: 27723620, memory: 211.51MB
pins2lts-mc-linux64( 0/ 8), 145.035: Tree memory: 509.6MB, 16.1 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 145.035: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 145.035: Stored 989 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 145.035: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 145.035: Est. total memory use: 721.1MB (~1235.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10750509620159971447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10750509620159971447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 08:17:14] [INFO ] Flatten gal took : 49 ms
[2023-03-15 08:17:14] [INFO ] Flatten gal took : 53 ms
[2023-03-15 08:17:14] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4723287510821601628.gal : 7 ms
[2023-03-15 08:17:14] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability860716750936004530.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4723287510821601628.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability860716750936004530.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityFireability860716750936004530.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :96986 after 248582
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 15428136 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15628852 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-S10J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBNT-COL-S10J20, 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 r307-tall-167873961400422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 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 ;